Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

Author： Hoogeveen J.A. Lenstra J.K. Veltman B.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.89, Iss.1, 1996-02, pp. : 172-175

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop

By Oguz C. Fikret Ercan M. Edwin Cheng T.C. Fung Y.F.

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 390-403

Elsevier

Access to resources Recommend Favorite

Two-stage open shop scheduling with a bottleneck machine

By Drobouchevitch I.G. Strusevich V.A.

European Journal of Operational Research, Vol. 128, Iss. 1, 2001-01 ,pp. : 159-174

Elsevier

Access to resources Recommend Favorite

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

By Drobouchevitch I.G. Strusevich V.A.

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 229-240

Elsevier

Access to resources Recommend Favorite

Local search algorithms for the multiprocessor flow shop scheduling problem

By Negenman E.G.

European Journal of Operational Research, Vol. 128, Iss. 1, 2001-01 ,pp. : 147-158

Elsevier

Access to resources Recommend Favorite

A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness

By Gladky A.A.

European Journal of Operational Research, Vol. 103, Iss. 1, 1997-11 ,pp. : 113-116

Elsevier

Access to resources Recommend Favorite