Local Search Genetic Algorithms for the Job Shop Scheduling Problem

Author：  

Publisher： Springer Publishing Company

ISSN： 0924-669X

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

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

Comparative evaluation of genetic algorithms for job-shop scheduling

By Ponnambalam S. G.   Aravindan P.   Rao P.S.  

Production Planning and Control, Vol. 12, Iss. 6, 2001-09 ,pp. : 560-574

Taylor & Francis Ltd

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

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

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

Prototyped genetic search: a cybernetical approach to job-shop scheduling problems

By Khoukhi Amar  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 1, 2002-02 ,pp. : 96-114

Emerald Group Publishing Ltd

Access to resources Recommend Favorite