Genetic Algorithm for Single Machine Scheduling Problem with Setup Times

Quan Ouyang; Hong Yun Xu

doi:10.4028/www.scientific.net/AMM.457-458.1678

Paper Titles

A Windchill-Based PDM Application to Enhance Agricultural Machinery Chassis Design
p.1653

Twin Gating System Design for Typical Thin Wall Stainless Steel Castings Based on Fast Pouring Mechanism
p.1657

Robust Optimization of RFID's Investment in Supply Chain with Inaccurate Inventory
p.1661

Operation Optimization of the Airport Check-In System
p.1665

Application of Building Information Model Technology in Shanghai Disaster Tolerant Center Construction
p.1669

A Modular Factory Planning Approach Based on Vertical Integration of the Information Flow
p.1673

Genetic Algorithm for Single Machine Scheduling Problem with Setup Times
p.1678

Research of Risk Control of Public Construction Project Based on Fault Tree
p.1682

Studies on Sprinklers Arrangement in Sprinkler Systems
p.1686

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 457-458Genetic Algorithm for Single Machine Scheduling...

Genetic Algorithm for Single Machine Scheduling Problem with Setup Times

Abstract:

This paper describes a genetic algorithm to solve the single machine scheduling problem with setup times, which uses the fixed two point crossover operator (F2PX) to produce new offspring chromosomes and uses the roulette wheel method in the selection of the chromosome population. In order to avoid the premature convergence we use a neighborhood based mutation operator to conduct disturbance in our genetic algorithm. Through the application of this genetic algorithm in practical scheduling problems, the effect of the genetic algorithm proposed in this paper is remarkable.

You might also be interested in these eBooks

Frontiers of Mechanical Engineering and Materials Engineering II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 457-458)

Pages:

1678-1681

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.457-458.1678

Citation:

Cite this paper

Online since:

October 2013

Authors:

Quan Ouyang*, Hong Yun Xu

Keywords:

Crossover, Genetic Algorithm (GA), Mutation, Selection, Single Machine Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Cheng R Q. The theory and methods of scheduling[M]. Huazhong University of science and Technology Press, (1987).

Google Scholar

[2] Rodammer F A and White K P. A recent survey of production scheduling. IEEE Trans. SMC, 1988, 18(6): 841~851.

DOI: 10.1109/21.23085

Google Scholar

[3] Du J, Leung JY-T. Minimizing total tardiness on one machine is NP-hard [J]. Mathematics of Operations Research, 1990, 15(3): 483–95.

DOI: 10.1287/moor.15.3.483

Google Scholar

[4] Holland J H. Adaptation in natural and artificial systems. Ann Arbor, The University ofMichigan Press, (1975).

Google Scholar

[5] Lee Y H, Bhaskaran K, Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups[J]. IIE transactions, 1997, 29(1): 45-52.

DOI: 10.1080/07408179708966311

Google Scholar

[6] Kellegöz T, Toklu B, Wilson J. Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem[J]. Applied Mathematics and Computation, 2008, 199(2): 590-598.

DOI: 10.1016/j.amc.2007.10.013

Google Scholar

[7] Cheng R. A study on genetic algorithms-based optimal scheduling techniques: [PhDthesis]. Tokyo Institute of Technology, (1997).

Google Scholar