Migrating birds optimization for hybrid flow shop scheduling problem with makespan

DOI

10.2991/icmia-17.2017.123How to use a DOI?

Keywords

Hybrid flowshop; Makespan; Metaheuristics; Migrating birds optimization

Abstract

This paper use migrating birds optimization algorithm to minimize makespan on hybrid flow shop problem firstly in the literature. According to the characteristics of hybrid flow shop problem, this paper proposed a job sequence adjustment model based on probability. Then combined the adjustment model with migrating birds optimization algorithm to solve standard benchmark problems and proved its validity.

Copyright

© 2017, 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  - Caile Ren
AU  - Chaoyong Zhang
AU  - Yanbin Zhao
AU  - Leilei Meng
PY  - 2017/06
DA  - 2017/06
TI  - Migrating birds optimization for hybrid flow shop scheduling problem with makespan
BT  - Proceedings of the 2017 6th International Conference on Measurement, Instrumentation and Automation (ICMIA 2017)
PB  - Atlantis Press
SP  - 689
EP  - 692
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmia-17.2017.123
DO  - 10.2991/icmia-17.2017.123
ID  - Ren2017/06
ER  -