Genetic Algorithm Based on Simulation for Single Machine Scheduling Problem with Setup Times

Mei Hong Liu; Zhen Hua Li; Jun Ruo Chen

doi:10.4028/www.scientific.net/AMR.328-330.404

Paper Titles

Invention of Nano-Material Synthesis Process Equipment via Vapor-Phase Technics
p.384

Design and Realization of a Flexible Claw of Rough Wall Climbing Robot
p.388

The Research of GPRS-Based Remote Fault Monitoring System for CNC Machine Tools
p.393

An Algorithm for Best-Fit of a Pattern of Profile Features to the True Profile
p.398

Genetic Algorithm Based on Simulation for Single Machine Scheduling Problem with Setup Times
p.404

Virtual Prototype Co-Simulation of 4WS Vehicle
p.408

Numerical Analysis on Surface Stress of Rectangle Piston Ring with Chromium Coating
p.412

Study on Intelligent Manufacturing System Model of Iron and Steel Enterprises in Ubiquitous Information Environment
p.416

The Green Design for the Moving Device of the Silt Coal Load Machine
p.421

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 328-330Genetic Algorithm Based on Simulation for Single...

Genetic Algorithm Based on Simulation for Single Machine Scheduling Problem with Setup Times

Abstract:

Single machine scheduling problem with setup times is proved to be an NP-hard problems, and its complexity is equivalent to the traveling salesman problem (TSP) of n cites. Integrating the advantages of simulation and genetic algorithm (GA), this paper proposes a GA based on simulation to solve this NP-hard problem. Then, it introduces how to build the simulation model and how to design chromosome coding and selection, crossover and mutation operators of GA for this special scheduling problem in details. An experiment has been carried out and the result proves that the method is feasible and should be adopted.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 328-330)

Pages:

404-407

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.328-330.404

Citation:

Cite this paper

Online since:

September 2011

Authors:

Mei Hong Liu, Zhen Hua Li, Jun Ruo Chen

Keywords:

Genetic Algorithm (GA), Setup Time, Simulation, Single Machine Scheduling Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Brucker,P., Jurisch,B., Sievers,B. A branch and bound algorithm for the job shop scheduling problem [J]. Discrete Applied Mathematics, 1994, 49(1): 109-127.

DOI: 10.1016/0166-218x(94)90204-6

Google Scholar

[2] Andrew Manikas, Yih-Long Chang. Multi-criteria sequence-dependent job shop scheduling using genetic algorithms. Computers & Industrial Engineering, 2009, 56: 179-185.

DOI: 10.1016/j.cie.2008.05.002

Google Scholar

[3] Tsung-Che Chiang, Li-Chen Fu. Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times. European Journal of Operational Research, 2009, 196: 78–92.

DOI: 10.1016/j.ejor.2007.12.042

Google Scholar

[4] LIU Min, Wu Cheng. Intelligent optimization scheduling algorithms for manufacturing process and their application. Beijing: National Defense Industry Press, 2008: 15-16.

Google Scholar