Geodesic
On the complexity of constructing multiprocessor little-preemptive schedules
Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 178-190

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

We present a full and correct proof of the fact that the problem of constructing an optimal schedule for the open shop problem with at most $m-3$ preemptions for an $m$‑processor system is NP-hard. We also show that the proof of this result given by E. Shchepin and N. Vakhania in Ann. Oper. Res. 159, 183–213 (2008) is incorrect. 
@article{TRSPY_2015_290_a14,
     author = {E. V. Shchepin},
     title = {On the complexity of constructing multiprocessor little-preemptive schedules},
     journal = {Informatics and Automation},
     pages = {178--190},
     publisher = {mathdoc},
     volume = {290},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a14/}
}
TY  - JOUR
AU  - E. V. Shchepin
TI  - On the complexity of constructing multiprocessor little-preemptive schedules
JO  - Informatics and Automation
PY  - 2015
SP  - 178
EP  - 190
VL  - 290
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a14/
LA  - ru
ID  - TRSPY_2015_290_a14
ER  - 
%0 Journal Article
%A E. V. Shchepin
%T On the complexity of constructing multiprocessor little-preemptive schedules
%J Informatics and Automation
%D 2015
%P 178-190
%V 290
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a14/
%G ru
%F TRSPY_2015_290_a14
E. V. Shchepin. On the complexity of constructing multiprocessor little-preemptive schedules. Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 178-190. http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a14/