A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines

Author: Yang Jaehwan  

Publisher: Taylor & Francis Ltd

ISSN: 0020-7543

Source: International Journal of Production Research, Vol.48, Iss.5, 2010-01, pp. : 1531-1538

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