Genetic Algorithm with Direction Selection for the Hybrid Flow Shop Scheduling Problem with makespan minimization

DOI

10.2991/icmii-15.2015.28How to use a DOI?

Keywords

production scheduling; hybrid flow shop; genetic algorithm; active schedule; reversibility

Abstract

The regular hybrid flow shop scheduling problem, with m stages, identical parallel machines and makespan minimization, is investigated and served as the natural starting point for the hybrid flow shop scheduling problems. Some properties of this scheduling problem were discussed, and they lead to the theoretical foundation and instruction for algorithm design. Based on the active scheduling technique and reversibility property, a genetic algorithm with direction selection combined with extended Giffler & Thompson algorithm was developed. The experimental results of benchmark problems and comparisons with two other algorithms indicate the effectiveness of the proposed algorithm.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhixiong Su
AU  - Junmin Yi
PY  - 2015/10
DA  - 2015/10
TI  - Genetic Algorithm with Direction Selection for the Hybrid Flow Shop Scheduling Problem with makespan minimization
BT  - Proceedings of the 3rd International Conference on Mechatronics and Industrial Informatics
PB  - Atlantis Press
SP  - 149
EP  - 153
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmii-15.2015.28
DO  - 10.2991/icmii-15.2015.28
ID  - Su2015/10
ER  -