On the hardness of the classical job shop problem

Author： Bräsel H.   Harborth M.   Tautenhahn T.   Willenius P.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.92, Iss.1, 1999-01, pp. : 265-279

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

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

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

A job-shop problem with one additional resource type

By Agnetis Alessandro  

Journal of Scheduling, Vol. 14, Iss. 3, 2011-06 ,pp. : 225-237

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

Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem

By Dorndorf U.  

Annals of Operations Research, Vol. 115, Iss. 1-4, 2002-09 ,pp. : 125-145

Springer Publishing Company

Access to resources Recommend Favorite