Approximability of two-machine no-wait flowshop scheduling with availability constraints

Author： Cheng T.C.E.   Liu Z.  

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.31, Iss.4, 2003-07, pp. : 319-322

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

Approximative procedures for no-wait job shop scheduling

By Schuster C.J.   Framinan J.M.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 308-318

Elsevier

Access to resources Recommend Favorite

Approximation algorithms for two-machine flow shop scheduling with batch setup times

By Chen B.   Potts C.N.   Strusevich V.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 255-271

Elsevier

Access to resources Recommend Favorite

Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency

By Logendran R.   Gelogullari C.A.   Sriskandarajah C.  

Robotics and Computer-Integrated Manufacturing, Vol. 19, Iss. 1, 2003-02 ,pp. : 21-33

Elsevier

Access to resources Recommend Favorite

Approximability of flow shop scheduling

By Hall L.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 175-190

Elsevier

Access to resources Recommend Favorite

A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

By Khan B. Shahul Hamid   Prabhaharan G.   Asokan P.  

International Journal of Computer Mathematics, Vol. 84, Iss. 12, 2007-12 ,pp. : 1731-1741

Taylor & Francis Ltd

Access to resources Recommend Favorite