Comparative evaluation of genetic algorithms for job-shop scheduling

Author： Ponnambalam S. G.   Aravindan P.   Rao P.S.  

Publisher： Taylor & Francis Ltd

ISSN： 1366-5871

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

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

Heuristic algorithms for job-shop scheduling problemswith stochastic precedence constraints

By Neumann K.   Schneider W.G.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 45-63

Springer Publishing Company

Access to resources Recommend Favorite

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

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

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