A search space analysis of the Job Shop Scheduling Problem

Author： Mattfeld D.C.   Bierwirth C.   Kopfer H.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

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

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

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

By  

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

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

An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

By Dauzère-Pérès S.   Paulli J.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 281-306

Springer Publishing Company

Access to resources Recommend Favorite

An Advanced Tabu Search Algorithm for the Job Shop Problem

By Nowicki Eugeniusz   Smutnicki Czesław  

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 145-159

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