Scheduling Hybrid Flow Shops by an Improved Memetic Algorithm

DOI

10.2991/iccasm.2012.208How to use a DOI?

Keywords

Scheduling, Hybrid flow shop, Buffer, Memetic algorithm, Makespan

Abstract

This study is concerned about how to optimize the production sequences to minimize the makespan in hybrid flow shops with limited intermediate buffers. An improved memetic algorithm (IMA) is proposed for solving the NP-hard problem. In this algorithm, the method of generating the initial population, the local search procedures, the selection, crossover and mutation operators are newly designed. Optimization results are compared between the IMA and other three scheduling algorithms proposed in previous literature. Comparison results show that the IMA proposed in this paper is feasible and efficient for scheduling hybrid flow shops with limited intermediate buffers.

Copyright

© 2012, 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  - Binggang Wang
PY  - 2012/08
DA  - 2012/08
TI  - Scheduling Hybrid Flow Shops by an Improved Memetic Algorithm
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 822
EP  - 824
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.208
DO  - 10.2991/iccasm.2012.208
ID  - Wang2012/08
ER  -