Quick value-setting algorithms for the longest path problem of job-shop scheduling

ISSN： 1741-038X

Source： Journal of Manufacturing Technology Management, Vol.16, Iss.8, 2005-01, pp. : 956-972

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

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

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

Springer Publishing Company

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