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

Author: Gladky A.A.  

Publisher: Elsevier

ISSN: 0377-2217

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

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