Modeling and Optimization of Cost-Based Hybrid Flow Shop Scheduling Problem using Metaheuristics
DOI:
https://doi.org/10.56225/ijgoia.v2i4.265Keywords:
Hybrid flow shop, Cost optimization, MetaheuristicsAbstract
The cost-based hybrid flow shop (CHFS) scheduling has been immensely studied due to its huge impact on productivity. For any profit-oriented organization, it is important to optimize total production costs. However, few researchers have studied hybrid flow shops (HFS) with total production cost utilization. This paper aims to develop a computational model and test the exploration capability of metaheuristics algorithms while optimizing the CHFS problem. Carlier and Neron defined three hypothetical benchmark problems for computational experiments. The popular optimization algorithms PSO, GA, and ACO were implemented on the CHFS model with ten optimization runs. The experimental results proven that ACO performed well regarding mean fitness value for all benchmark problems. Besides this, CPU time for PSO was very high compared to other algorithms. In the future, other optimization algorithms will be tested for the CHFS model, such as Teaching Learning Based Optimization (TLBO) and the Crayfish Optimization Algorithm (COA).
References
Anghinolfi, D., Paolucci, M., & Ronco, R. (2021). A bi-objective heuristic approach for green identical parallel machine scheduling. European Journal of Operational Research, 289(2), 416–434. https://doi.org/10.1016/j.ejor.2020.07.020
Behnamian, J., & Fatemi Ghomi, S. M. T. (2011). Hybrid flowshop scheduling with machine and resource-dependent processing times. Applied Mathematical Modelling, 35(3), 1107–1123. https://doi.org/10.1016/j.apm.2010.07.057
Brabazon, A., O’Neill, M., & McGarraghy, S. (2015). Genetic Algorithm. In Report submitted at IIT Bombay (pp. 21–42). https://doi.org/10.1007/978-3-662-43631-8_3
Carlier, J., & Neron, E. (2000). An Exact Method for Solving the Multi-Processor Flow-Shop. RAIRO - Operations Research, 34(1), 1–25. https://doi.org/10.1051/ro:2000103
Dabiri, M., Yazdani, M., Naderi, B., & Haleh, H. (2022). Modeling and solution methods for hybrid flow shop scheduling problem with job rejection. Operational Research, 22(3), 2721–2765. https://doi.org/10.1007/s12351-021-00629-2
Deng, W., Xu, J., Song, Y., & Zhao, H. (2021). Differential evolution algorithm with wavelet basis function and optimal mutation strategy for complex optimization problem. Applied Soft Computing, 100(3), 106–724. https://doi.org/10.1016/j.asoc.2020.106724
Dong, J., & Ye, C. (2022). Green scheduling of distributed two-stage reentrant hybrid flow shop considering distributed energy resources and energy storage system. Computers & Industrial Engineering, 169(7), 108–146. https://doi.org/10.1016/j.cie.2022.108146
Fakhrzad, M. B., & Heydari, M. (2008). A Heuristic Algorithm for Hybrid Flow-Shop Production Scheduling to Minimize the Sum of the Earliness and Tardiness Costs. Journal of the Chinese Institute of Industrial Engineers, 25(2), 105–115. https://doi.org/10.1080/10170660809509076
Fanjul-Peyro, L. (2020). Models and an exact method for the Unrelated Parallel Machine scheduling problem with setups and resources. Expert Systems with Applications: X, 5(4), 10–22. https://doi.org/10.1016/j.eswax.2020.100022
Fei, H., Meskens, N., & Chu, C. (2010). A planning and scheduling problem for an operating theatre using an open scheduling strategy. Computers & Industrial Engineering, 58(2), 221–230. https://doi.org/10.1016/j.cie.2009.02.012
Geng, K., Ye, C., Dai, Z. hua, & Liu, L. (2020). Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs. Complexity, 31(12), 1469–1480. https://doi.org/10.1155/2020/8565921
Istokovic, D., Perinic, M., Vlatkovic, M., & Brezocnik, M. (2020). Minimizing Total Production Cost in a Hybrid Flow Shop: a Simulation-Optimization Approach. International Journal of Simulation Modelling, 19(4), 559–570. https://doi.org/10.2507/IJSIMM19-4-525
Janiak, A., Kozan, E., Lichtenstein, M., & Oğuz, C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105(2), 407–424. https://doi.org/10.1016/j.ijpe.2004.05.027
Jiang, S., Liu, M., Hao, J., & Qian, W. (2015). A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry. Computers & Industrial Engineering, 87(9), 518–531. https://doi.org/10.1016/j.cie.2015.06.002
Li, X., Tang, H., Yang, Z., Wu, R., & Luo, Y. (2020). Integrated Optimization Approach of Hybrid Flow-Shop Scheduling Based on Process Set. IEEE Access, 8(14), 223782–223796. https://doi.org/10.1109/ACCESS.2020.3044606
Lian, X., Zheng, Z., Wang, C., & Gao, X. (2021). An energy-efficient hybrid flow shop scheduling problem in steelmaking plants. Computers & Industrial Engineering, 162(12), 107–683. https://doi.org/10.1016/j.cie.2021.107683
Luo, H., Du, B., Huang, G. Q., Chen, H., & Li, X. (2013). Hybrid flow shop scheduling considering machine electricity consumption cost. International Journal of Production Economics, 146(2), 423–439. https://doi.org/10.1016/j.ijpe.2013.01.028
Marini, F., & Walczak, B. (2015). Particle swarm optimization (PSO). A tutorial. Chemometrics and Intelligent Laboratory Systems, 149(15), 153–165. https://doi.org/10.1016/j.chemolab.2015.08.020
Moazami Goodarzi, R., Ahmadizar, F., & Farughi, H. (2021). Integrated hybrid flow shop scheduling and vehicle routing problem. Journal of Industrial and Systems Engineering, 13(2), 223–244.
Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1–18. https://doi.org/10.1016/j.ejor.2009.09.024
Shao, W., Shao, Z., & Pi, D. (2022). A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm and Evolutionary Computation, 75(12), 101–190. https://doi.org/10.1016/j.swevo.2022.101190
Songserm, W., & Wuttipornpun, T. (2019). MIP-based heuristic algorithm for finite capacity MRP problem in hybrid flow shop with unrelated parallel machines. International Journal of Industrial and Systems Engineering, 33(2), 181–203. https://doi.org/10.1504/IJISE.2019.102470
Sukkerd, W., Latthawanichphan, J., Wuttipornpun, T., & Songserm, W. (2021). Non-population Metaheuristics with a New Fitness Evaluation to Minimise Total Penalty Costs for a Hybrid Flow Shop with Assembly Operations Scheduling Problem. 2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C), 340–346. https://doi.org/10.1109/RI2C51727.2021.9559828
Wang, M., Zhong, R. Y., Dai, Q., & Huang, G. Q. (2016). A MPN-based scheduling model for IoT-enabled hybrid flow shop manufacturing. Advanced Engineering Informatics, 30(4), 728–736. https://doi.org/10.1016/j.aei.2016.09.006
Wang, Y., Tang, J., Pan, Z., & Yan, C. (2015). Particle swarm optimization-based planning and scheduling for a laminar-flow operating room with downstream resources. Soft Computing, 19(10), 2913–2926. https://doi.org/10.1007/s00500-014-1453-z
Zheng, X., Zhou, S., Xu, R., & Chen, H. (2020). Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm. International Journal of Production Research, 58(13), 4103–4120. https://doi.org/10.1080/00207543.2019.1642529
Zohali, H., Naderi, B., Mohammadi, M., & Roshanaei, V. (2019). Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Computers & Operations Research, 104(4), 127–138. https://doi.org/10.1016/j.cor.2018.12.008
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright @2022. This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0/) which permits unrestricted to copy and redistribute the material in any medium or format, remix, transform, and build upon the material for any purpose, even commercially.
This work is licensed under a Creative Commons Attribution 4.0 International License.