The Study of Job Shop Scheduling Based on Genetic Algorithm

Article Preview

Abstract:

Aiming at Job Shop Scheduling Problem with Minimal Makespan, This paper is designed to use genetic algorithm to solve the problem of job shop scheduling, and also achieves the algorithm by using the C#. Application shows that the genetic algorithm to solve job shop scheduling problem is efficient and has good application value.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 201-203)

Pages:

795-798

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Xi WeiDong: A genetic algorithm for flexible job shop scheduling based on two-substring gene coding method, Journal of HarBin Institute of Technology, vol. 39(2007), p.1151.

Google Scholar

[2] Ju QuanYong: Study of Job Shop Scheduling Using Immune Genetic Algorithm, Mechanical Science and Technology for Aerospace Engineering,vol. 26(2007), p.681.

Google Scholar

[3] Cheng R W: A tutorial survey of Job - Shop Scheduling Problem using genetic algorithms part II hybrid genetic search strategies, Computer & Industrial Engineering , vol. 36(1999), p.343.

DOI: 10.1016/s0360-8352(99)00136-9

Google Scholar

[4] Jiao L and Wang L: A novel genetic algorithm based on immunity, IEEE Transactions on System, Man and Cybernetics, Vol. 30 (2000), p.552.

Google Scholar

[5] Coello Coello C A and Cortes Rivera D: Use of an Artif icial Immune System for Job Shop Scheduling. Berlin Heidelberg, Sp ringer-Verlag(2003).

Google Scholar