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

Author： Drobouchevitch I.G.   Strusevich V.A.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

Two simulated annealing-based heuristics for the job shop scheduling problem

By Steinhofel K.   Albrecht A.   Wong C.K.  

European Journal of Operational Research, Vol. 118, Iss. 3, 1999-11 ,pp. : 524-548

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

By Kravchenko S.A.  

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 101-107

Elsevier

Access to resources Recommend Favorite

A tabu search method guided by shifting bottleneck for the job shop scheduling problem

By Pezzella F.   Merelli E.  

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 297-310

Elsevier

Access to resources Recommend Favorite

A bicriteria approach to the two-machine flow shop scheduling problem

By Sayin S.   Karabati S.  

European Journal of Operational Research, Vol. 113, Iss. 2, 1999-03 ,pp. : 435-449

Elsevier

Access to resources Recommend Favorite