A job-shop problem with one additional resource type

Author： Agnetis Alessandro  

Publisher： Springer Publishing Company

ISSN： 1094-6136

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

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

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

A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

By Frutos Mariano  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 745-765

Springer Publishing Company

Access to resources Recommend Favorite

A multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem

By Wang Xiaojuan   Gao Liang   Zhang Chaoyong   Li Xinyu  

International Journal of Computer Applications in Technology, Vol. 45, Iss. 2-3, 2012-12 ,pp. : 115-125

Inderscience Publishers

Access to resources Recommend Favorite

On the hardness of the classical job shop problem

By Bräsel H.   Harborth M.   Tautenhahn T.   Willenius P.  

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

Springer Publishing Company

Access to resources Recommend Favorite

An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times

By Artigues C.   Roubellat O.  

Production Planning and Control, Vol. 13, Iss. 2, 2002-03 ,pp. : 175-186

Taylor & Francis Ltd

Access to resources Recommend Favorite