Improved Migrating Birds Optimization Algorithm to Solve Hybrid Flowshop Scheduling Problem with Lot-Streaming

18Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hybrid flowshop scheduling problem with lot-streaming (HLFS) has played an important role in modern industrial systems. In this paper, we preset an improved migrating birds optimization (IMBO) algorithm for HLFS to minimize makespan. To ensure the diversity of initial population, a Nawaz-Enscore-Ham (NEH) heuristic algorithm is used to generate the leader, and the remaining solutions are randomly generated. According to the characteristics of the HLFS problem, we propose a combined neighborhood search structure that consists of four different neighborhood operators. We design effective local search procedure to explore potential promising domains. In addition, a reset mechanism is added to avoid falling into local optimum. Extensive experiments and comparison demonstrate the feasibility and effectiveness of the proposed algorithm.

Cite

CITATION STYLE

APA

Wang, P., Sang, H., Tao, Q., Guo, H., Li, J., Gao, K., & Han, Y. (2020). Improved Migrating Birds Optimization Algorithm to Solve Hybrid Flowshop Scheduling Problem with Lot-Streaming. IEEE Access, 8, 89782–89792. https://doi.org/10.1109/ACCESS.2020.2993881

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free