Genetic Algorithm Design and Simulation for Job-Shop Scheduling Problem

Article Preview

Abstract:

This paper proposes an effective genetic algorithm for the job-shop scheduling problem (JSP) to minimize makespan time. An effective chromosome representation based on real coding is used to conveniently represent a solution of the JSP, and different strategies for selection, crossover and mutation are adopted. Simulation experimental results have shown that the scheduling model using the algorithm can allocate jobs efficiently and effectively.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1436-1440

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] G.C. Luh. C.H. Chueh. Information Sci Vol.179 (2009), p.1516

Google Scholar

[2] G.H. Zhang, L. Gao, Y. Shi. Expert Syst Appl Vol.28 (2011), p.3563

Google Scholar

[3] J.Q. Li, Q.K. Pan, Y.C. Liang. Comput Ind Eng Vol.59 (2010), p.647

Google Scholar

[4] G. Moslehi, M. Mahnam. Int J Prod Econ Vol. 129 (2011), p.14

Google Scholar

[5] A. Bagheri, M. Zandieh, I. Mahdavi, M. Yazdani. Future Gener Comp Sy Vol. 26 (2010), p.533

Google Scholar

[6] J. F. GonÇalves, J.J. de Magallhães Mendes, G.C.R. Maurício. Eur J Oper Res Vol. 167 (2005), p.77

Google Scholar