Muhammad Ridwan Andi PurnomoThis email address is being protected from spambots. You need JavaScript enabled to view it. and Hari Purnomo
Department of Industrial Engineering, Faculty of Industrial Technology, Universitas Islam Indonesia, Yogyakarta, Indonesia, 55584
Received: October 26, 2023 Accepted: February 5, 2024 Publication Date: April 13, 2024
Copyright The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.
Supply chain system for innovative products typically adopts Make-to-Order (MTO) approach, which involves implementing a strict product delivery to customers. The production shop floor also needs additional time to foster innovation. Hence, the machine scheduling for the parts production must considering the delivery time to customers, while simultaneously minimising the scheduling makespan. The issue will be further compounded when the production shop floor has a restricted capacity for storing parts work-in-process and it is commonly known as no-wait flowshop system. Consequently, the machine scheduling must also consider minimising the waiting time for parts work-in-process in between machines. The aim of this study is to develop a machine scheduling optimisation model with those three objectives, and to the best for our knowledge, there is no existing studies on simultaneously optimising those objectives. In this case, there are 30 parts on 5 serial machines, resulting in a vast number of viable solutions. The optimisation model has been addressed by employing two intelligent algorithms, namely Genetic Algorithm (GA) and Particle Swarm Optimisation (PSO). The GA shows superior performance and its solution able to decrease the number of tardy parts, decrease the scheduling makespan by 15 minutes and decrease the overall waiting time for the parts work-in-process by 203 minutes. This enhancement has a beneficial effect on the supply chain system by enhancing the reputation for punctual delivery, providing additional time to do product innovations, and diminishing the likelihood of damage to parts work-in-process during the manufacturing process.
[1] Y. Zhai, G. Hua, M. Cheng, and T. Cheng, (2023) “Production lead-time hedging and order allocation in an MTO supply chain" European Journal of Operational Research 311(3): 887–905.
[2] R. Hammami, Y. Frein, and A. Albana, (2020) “Delivery time quotation and pricing in two-stage supply chains: Centralized decision-making with global and local managerial approaches" European Journal of Operational Research 286(1): 164–177.
[3] C. Yu, A. Matta, Q. Semeraro, and J. Lin, (2022) “Mathematical Models for Minimizing Total Tardiness on Parallel Additive Manufacturing Machines" IFAC PapersOnLine 55(10): 1521–1526.
[4] Y. Sang, J. Wang, M. Sterna, and J. Blazewicz, (2023) “Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work" Omega 121: 1–13.
[5] D. Shabtay, G. Mosheiov, and D. Oron, (2023) “Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work" European Journal of Operational Research 303(1): 66–77.
[6] D. Lee, D. Lee, and K. Kim, (2023) “Self-growth learning-based machine scheduler to minimize setup time and tardiness in OLED display semiconductor manufacturing" Applied Soft Computing 145: 1–14.
[7] L. Chen, W. Yang., K. Qiu, and S. Dauzere-Peres, (2023) “A lexicographic optimization approach for a biobjective parallel-machine scheduling problem minimizing total quality loss and total tardiness" Computers Operations Research 155: 1–14.
[8] H. Rahman, M. Janardhanan, L. Chuen, and S. Ponnambalan, (2021) “Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain" Computers Industrial Engineering 158: 1–19.
[9] H. Wang, R. Li, and W. Gong, (2023) “Minimizing tardiness and makespan for distributed heterogeneous unrelated parallel machine scheduling by knowledge and Pareto-based memetic algorithm" Egyptian Informatics Journal 24: 1–17.
[10] M. Avci, (2023) “An effective iterated local search algorithm for the distributed no-wait flowshop scheduling problem" Engineering Applications of Artificial Intelligence 120: 1–10.
[11] M. Avci, M. Avci, and A. Hamzadayi, (2022) “A branch-and-cut approach for the distributed no-wait flowshop scheduling problem" Computers Operations Research 148: 1–14.
[12] C. Cheng, P. Pourhejazy, K. Ying, and Y. Liao, (2021) “New benchmark algorithms for No-wait Flowshop Group Scheduling Problem with Sequence-Dependent Setup Times" Applied Soft Computing 111: 1–16.
[13] C. Andrade, T. Silva, and L. Pessoa, (2019) “Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm" Expert Systems With Applications 128: 67–80.
[14] K. Shen, T. Pessemier, L. Martens, and W. Joseph, (2021) “A parallel genetic algorithm for multi-objective flexible flowshop scheduling in pasta manufacturing" Computers Industrial Engineering 161: 1–11.
[15] X. Sun, W. Shen, and B. Vogel-Heuser, (2023) “A hybrid genetic algorithm for distributed hybrid blocking flowshop scheduling problem" Journal of Manufacturing Systems 71: 390–405.
[16] X. Tao, Q. Pan, H. Sang, L. Gao, A. Yang, and M. Rong, (2023) “Nondominated sorting genetic algorithmII with Q-learning for the distributed permutation flowshop rescheduling problem" Knowledge-Based Systems 278: 1–19.
[17] J. Tsai, C. Yang, and J. Chou, (2014) “Hybrid sliding level Taguchi-based flowshop particle swarm optimization for scheduling problems" Applied Soft Computing 15: 177–192.
[18] M. Eddaly, B. Jarboui, and P. Siarry, (2016) “Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem" Journal of Computational Design and Engineering 3: 295–311.
[19] M. Marichelvam, M. Geetha, and O. Tosun, (2022) “An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors – A case study" Computers and Operations Research 114: 1–9.
[20] H. Ishibuchi, N. Tsukamoto, and Y. Nojima. Evolutionary many-objective optimization: A short review. en. IEEE World Congress on Computational Intelligence, 2008, 2419–2426.
[21] S. Deng, Y. Li, J. Wang, R. Cao, and M. Li, (2023) “A feature-thresholds guided genetic algorithm based on a multi-objective feature scoring method for highdimensional feature selection" Applied Soft Computing 148: 1–14.
[22] M. Nazeri, A. Mollahosseini, and I. Izadi, (2023) “A centrality based genetic algorithm for the graph burning problem" Applied Soft Computing 144: 1–9.
[23] C. Xu and S. Zhang, (2024) “A Genetic Algorithm-based sequential instance selection framework for ensemble learning" Expert Systems With Applications 236: 1–14.
[24] M. Gen and R. Cheng. Genetic Algorithms and Engineering Optimization. en. John Wiley Sons, Inc, 2000.
[25] D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. en. Addison-Wesley Publishing Company, Inc, 1989.
[26] S. Chen and C. Chien, (2011) “Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques" Expert Systems with Applications 38(12): 14439–14450.
[27] Y. Zhong, J. Lin, L. Wang, and H. Zhang, (2018) “Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem" Swarm and Evolutionary Computation 42: 77–88.
[28] M. Mahi, O. Baykan, and H. Kodaz, (2015) “A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem" Applied Soft Computing 30: 484–490.
[29] H. Thiriez, (2001) “Improved OR education through the use of spreadsheet models" European Journal of Operational Research 135: 461–476.
We use cookies on this website to personalize content to improve your user experience and analyze our traffic. By using this site you agree to its use of cookies.
