Migrating birds optimization for hybrid flow shop scheduling problem with makespan
Caile Ren, Chaoyong Zhang, Yanbin Zhao, Leilei Meng
Available Online June 2017.
- https://doi.org/10.2991/icmia-17.2017.123How to use a DOI?
- Hybrid flowshop; Makespan; Metaheuristics; Migrating birds optimization
- 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.
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 PB - Atlantis Press SP - 689 EP - 692 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 -