Gene Shift Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Limited Waiting Times

DOI

10.2991/esac-15.2015.52How to use a DOI?

Keywords

Permutation flowshop scheduling, Partheno-genetic algorithm, Limited waiting times, Gene exchange operator

Abstract

Permutation flowshop scheduling with limited waiting times restricts maximum values of waiting times of jobs between consecutive machines. The problem with the objective of makespan is a NP-hard combination optimization problem. Considering characters of this scheduling problem, a basic Partheno-Genetic Algorithm (PGA) is presented, and constructions of two kinds of gene shift operators in PGA are focused on, including single-point shift operator and multi-point shift operator. Computational Experiments are carried out to evaluate the optimization performances of the two operators, and results show that single-point shift operator performs better in the basic PGA for this scheduling problem.

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  - Bailin Wang
AU  - Haifeng Wang
AU  - Tieke Li
PY  - 2015/08
DA  - 2015/08
TI  - Gene Shift Operators of Partheno-Genetic Algorithm for Permutation Flowshop Scheduling with Limited Waiting Times
BT  - Proceedings of the 2015 International Conference on Electronic Science and Automation Control
PB  - Atlantis Press
SP  - 209
EP  - 212
SN  - 2352-538X
UR  - https://doi.org/10.2991/esac-15.2015.52
DO  - 10.2991/esac-15.2015.52
ID  - Wang2015/08
ER  -