A heuristic algorithm for two-machine re-entrant shop scheduling

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

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.86, Iss.1, 1999-01, pp. : 417-439

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

Inverse scheduling: two-machine flow-shop problem

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 239-256

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm for minimum wait drainingof two-station fluid re-entrant line

By Weiss G.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 65-86

Springer Publishing Company

Access to resources Recommend Favorite

Two-Machine Flowshop Batching and Scheduling

By Lin B.  

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 149-161

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic for scheduling in a two-machine bicriteria dynamic flowshop with setup and processing times separated

By Su L-H.   Chou F-D.  

Production Planning and Control, Vol. 11, Iss. 8, 2000-12 ,pp. : 806-819

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Gupta Jatinder N.D.  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 171-185

Springer Publishing Company

Access to resources Recommend Favorite