Adaptive Genetic Algorithm for Hybrid Flow-Shop Scheduling

Article Preview

Abstract:

This paper studies the scheduling problem of Hybrid Flow Shop (HFS) under the objective of minimizing makespan. The corresponding scheduling simulation system is developed in details, which employed a new encoding method so as to guarantee the validity of chromosomes and the convenience of calculation. The corresponding crossover and mutation operators are proposed for optimum sequencing. The simulation results show that the adaptive Genetic Algorithm (GA) is an effective and efficient method for solving HFS Problems.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 753-755)

Pages:

2925-2929

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Widmer M, Hertz A. Eur J Oper Res, 1989, 41(2): 186–(1931).

Google Scholar

[2] Pinedo M. Prentice-Hall, Englewood Cliffs, New Jersey, (1995).

Google Scholar

[3] Gup ta JND. Operational Research Society, 1988, 39(4): 359-364.

Google Scholar

[4] Yang Jianbo. Systems, Man and Cybernetics, Part B, IEEE Transactions, 2001, 31(5): 824-835.

Google Scholar

[5] Hoogeveen J A, Lenstra J K. European Journal of Operational Research, 1996, 89(1): 172-175.

Google Scholar

[6] O Moursli, Y A Pochet. Int. J. Prod. Econ. 2000(64): 113-125.

Google Scholar

[7] Guinet A. Int. J ProRes, 1996(34): 1643-1654.

Google Scholar

[8] Iyer SK, Saxenab B. Comput Oper Res, 2004(31): 593-606.

Google Scholar

[9] Srinvas M, Patnaik L M. IEEE Trans Systems Man and Cybernetics, 1994, 24(4): 656-667.

Google Scholar