A new heuristic for the n -job, m -machine flow-shop problem

ISSN： 1366-5871

Source： Production Planning and Control, Vol.12, Iss.7, 2001-10, pp. : 648-653

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

Depth-first heuristic search for the job shop scheduling problem

By Mencía Carlos

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 265-296

Springer Publishing Company

Access to resources Recommend Favorite

On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

By Steiner George Xue Zhihui

Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. : 381-387

Springer Publishing Company

Access to resources Recommend Favorite

New Single Machine and Job-Shop Scheduling Problems with Availability Constraints

By Mauguière Ph. Billaut J.-C. Bouquard J.-L.

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 211-231

Springer Publishing Company

Access to resources Recommend Favorite

Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 8, 2014-08 ,pp. : 733-746

Taylor & Francis Ltd

Access to resources Recommend Favorite