Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity

Mohamed Ali Aloulou;  Mikhail Y. Kovalyov;  Marie-Claude Portmann — 2007

RAIRO - Operations Research

We study a deterministic problem of evaluating the worst case performance of flexible solutions in the single machine scheduling. A flexible solution is a set of schedules following a given structure determined by a partial order of jobs and a type of the schedules. In this paper, the schedules of active and non-delay type are considered. A flexible solution can be used on-line to absorb the impact of data disturbances related to, for example, job arrival, tool availability or machine breakdowns....

Internet shopping optimization problem

Jacek Błażewicz;  Mikhail Y. Kovalyov;  Jędrzej Musiał;  Andrzej P. Urbański;  Adam Wojciechowski — 2010

International Journal of Applied Mathematics and Computer Science

A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses...

Page 1

Download Results (CSV)