Geodesic
On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 74-98

Voir la notice de l'article provenant de la source Math-Net.Ru

We investigate the properties of optimal solutions of the NP-hard flow shop scheduling problem with preemption and an arbitrary regular objective function. It is shown that for any instance of the problem its optimal solution can be found by choosing appropriate job priority orders on each machine. The number of preemptions in such schedule is estimated from above. It is also shown that the length of the optimal schedule (for a specified regular criterion) is always equal to the total length of operations from a certain subset. The results of the paper significantly extend previously known results established for the flow shop problem with the minimum makespan objective. Il. 5, bibl. 10.
Keywords: theory of scheduling, preemption, optimal schedule, regular criterion. 
@article{DA_2009_16_3_a4,
     author = {D. A. Chemisova},
     title = {On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {74--98},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_3_a4/}
}
TY  - JOUR
AU  - D. A. Chemisova
TI  - On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 74
EP  - 98
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_3_a4/
LA  - ru
ID  - DA_2009_16_3_a4
ER  - 
%0 Journal Article
%A D. A. Chemisova
%T On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 74-98
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_3_a4/
%G ru
%F DA_2009_16_3_a4
D. A. Chemisova. On properties of optimal schedules in the flow shop problem with preemption and an arbitrary regular criterion. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 74-98. http://geodesic.mathdoc.fr/item/DA_2009_16_3_a4/