A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem

DOI

10.2991/icitmi-15.2015.142How to use a DOI?

Keywords

Distributed permutation flowshop scheduling; Genetic algorithms; Local search; Hybrid genetic algorithm.

Abstract

For solving the distributed permutation flowshop scheduling problem (DPFSP) with the objective of minimizing makespan we design a hybrid genetic algorithm. This algorithm combines a simple genetic algorithm, a local search algorithm and a plant allocation rule with the aim of minimizing the makespan. The experimental results show that the proposed algorithm outperforms the genetic algorithm in terms of efficiency and effectiveness for parts of the data.

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  - Yan Li
AU  - Zhigang Chen
PY  - 2015/10
DA  - 2015/10
TI  - A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem
BT  - Proceedings of the 4th International Conference on Information Technology and Management Innovation
PB  - Atlantis Press
SP  - 843
EP  - 847
SN  - 2352-538X
UR  - https://doi.org/10.2991/icitmi-15.2015.142
DO  - 10.2991/icitmi-15.2015.142
ID  - Li2015/10
ER  -