Proceedings of the 2017 6th International Conference on Measurement, Instrumentation and Automation (ICMIA 2017)

Migrating birds optimization for hybrid flow shop scheduling problem with makespan

Authors
Caile Ren, Chaoyong Zhang, Yanbin Zhao, Leilei Meng
Corresponding Author
Caile Ren
Available Online June 2017.
DOI
https://doi.org/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.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2017 6th International Conference on Measurement, Instrumentation and Automation (ICMIA 2017)
Part of series
Advances in Intelligent Systems Research
Publication Date
June 2017
ISBN
978-94-6252-387-6
ISSN
1951-6851
DOI
https://doi.org/10.2991/icmia-17.2017.123How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

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  - 2017 6th International Conference on Measurement, Instrumentation and Automation (ICMIA 2017)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmia-17.2017.123
DO  - https://doi.org/10.2991/icmia-17.2017.123
ID  - Ren2017/06
ER  -