Multidisciplinary International Conference on Scheduling: Theory and Application, Paris, France, 2009

Дублин : 2009.

Главы книги

Polynomial Algorithm for 1 | rj,pj = p, pmnt | Σ wicj Scheduling Problem

Кварацхелия А. Г., Лазарев А. А., , in: Multidisciplinary International Conference on Scheduling: Theory and Application, Paris, France, 2009.: Dublin: [б.и.], 2009. P. 68–76.

In this paper, we consider the minimizing total weighted completion time inpreemptive equal-length job with release dates scheduling problem on a single machine. Before this paper the problem is known to be open. Here, we present a polynomial timealgorithm that solves the problem with O(n^7) operations. ...

Добавлено: 4 марта 2013 г.

Estimation of Absolute Error for the Resources-Constrained Project Scheduling Problem

Лазарев А. А., Гафаров Е. Р., , in: Multidisciplinary International Conference on Scheduling: Theory and Application, Paris, France, 2009.: Dublin: [б.и.], 2009.

We consider some special cases of the NP-hard resource-constrained projectscheduling problem (RCPSP) to minimize the makespan. We conjecture that the ratioof the optimal makespan of RCPSP to that of the preemptive version of the problemis less than 2. We show that a well-known lower bounds for the problem may yield badapproximation ratios or its calculation ...

Добавлено: 4 марта 2013 г.