Abstract
An improved migrating birds optimization (IMBO) algorithm is proposed to solve the hybrid flowshop scheduling problem with lot-streaming of random breakdown (RBHLFS) with the aim of minimizing the total flow time. To ensure the diversity of the initial population, a Nawaz-Enscore-Ham (NEH) heuristic algorithm is used. A greedy algorithm is used to construct a combined neighborhood search structure. An effective local search procedure is utilized to explore potential promising neighborhoods. In addition, a reset mechanism is added to avoid falling into local optimum. Extensive experiments and comparisons demonstrate the feasibility and effectiveness of the proposed algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Peng, K., Pan, Q., Zhang, B.: An improved artificial bee colony algorithm for steelmaking-refining-continuous casting scheduling problem. Chin. J. Chem. Eng. 26(8), 1727–1735 (2018)
Nie, L., Wang, X., Liu, K., Bai, Y.: A rescheduling approach based on genetic algorithm for flexible scheduling problem subject to machine breakdown. J. Phys. Conf. Series, 1453-012018 (2020)
Tian, J., Zhou, Y., Fu, R.: An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown. J. Combin. Optim. 40(1), 170–180 (2020). https://doi.org/10.1007/s10878-020-00572-6
Duman, E., Uysal, M., and Alkaya, A.F.: Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf. Sci., (217) (2012)
Zhang, S.J., Gu, X.S., and Zhou, F.N.: An improved discrete migrating birds optimization algorithm for the no-wait flow shop scheduling problem. IEEE Access (99), 1 (2020)
Zhang, M., Tan, Y., Zhu, J., Chen, Y., and Chen, Z.: A competitive and cooperative migrating birds optimization algorithm for vary-sized batch splitting scheduling problem of flexible job-shop with setup time. Simul. Modell. Practice Theory (100), 102065(2019)
Wang, P., Sang, H., Tao, Q., Guo, H., Han, Y.: Improved migrating birds optimization algorithm to solve hybrid flowshop scheduling problem with lot-streaming. IEEE Access (99), 1 (2020)
Mao, J., Hu, X.L., Pan, Q.K., Miao, Z., Tasgetiren, M.F.: An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. In: 2020 39th Chinese Control Conference. https://doi.org/10.23919/CCC50068.2020.9189642
Marichelvam, M.K., Geetha, M., Tosun, M.: An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors-a case study. Comput. Oper. Res. (114), 104812 (2019)
Chen, T.L., Cheng, C.Y., Chou, Y.H.: Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming. Ann. Oper. Res. 290(4), 813–836(2020)
Sang, H.-Y., Pan, Q.-K., Duan, P.-Y., Li, J.-Q.: An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J. Intell. Manuf. 29(6), 1337–1349 (2015). https://doi.org/10.1007/s10845-015-1182-x
Huang, J.P., Pan, Q.K., Miao, Z.H., Gao, L.: Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng. Appl. Artif. Intell. (97), 104016(2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, P., De Leone, R., Sang, H. (2022). Improved Migrating Birds Optimization Algorithm to Solve Hybrid Flowshop Scheduling Problem with Lot-Streaming of Random Breakdown. In: Nicosia, G., et al. Machine Learning, Optimization, and Data Science. LOD 2021. Lecture Notes in Computer Science(), vol 13164. Springer, Cham. https://doi.org/10.1007/978-3-030-95470-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-95470-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95469-7
Online ISBN: 978-3-030-95470-3
eBook Packages: Computer ScienceComputer Science (R0)