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

ISSN： 1094-6136

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

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

A search space analysis of the Job Shop Scheduling Problem

By Mattfeld D.C. Bierwirth C. Kopfer H.

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 441-453

Springer Publishing Company

Access to resources Recommend Favorite

Practical job shop scheduling

By Schutten J.M.J.

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 161-178

Springer Publishing Company

Access to resources Recommend Favorite

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

Quick value-setting algorithms for the longest path problem of job-shop scheduling

By Hong Choi Shiu Yu Yang Feng

Journal of Manufacturing Technology Management, Vol. 16, Iss. 8, 2005-01 ,pp. : 956-972

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

Applied Intelligence, Vol. 21, Iss. 1, 2004-07 ,pp. : 99-109

Springer Publishing Company

Access to resources Recommend Favorite