Abstract
In this study, the uniform parallel machine scheduling problem with non-common due dates and sequence-dependent setup times is addressed for a real-life problem in the dye house of a hood manufacturer company. The aim of this study is to create an efficient scheduling tool for the company, which minimizes lateness (earliness and tardiness) in the system and reduces the buffer stock caused by the lateness. A mathematical model is developed for the problem and optimal results are obtained for the small-sized instances. As the studied problem is NP-hard, three heuristic algorithms are also proposed to solve larger instances. The performance of the proposed algorithms is evaluated with a detailed computational experiment. Furthermore, a user-friendly decision support system (DSS) is developed using Excel VBA interface and proposed solution approaches are embedded in the DSS. The developed DSS enables users to make an efficient scheduling in very short computational time and provides the results with detailed schedule reports and Gantt charts. As this problem can be faced in various industrial areas, the proposed solution approaches can also be applied to different sectors and factories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Heady, R.B., Zhu, Z.: Minimizing the sum of job earliness and tardiness in a multimachine system. Int. J. Prod. Res. 36(6), 1619–1632 (1998)
Radhakrishnan, S., Ventura, J.A.: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. Int. J. Prod. Res. 38(10), 2233–2252 (2000)
Garey, M.R., Tarjan, R.E., Wilfong, G.T.: One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13(2), 330–348 (1988)
Kim, D.W., Kim, K.H., Jang, W., Chen, F.F.: Unrelated parallel machine scheduling with setup times using simulated annealing. Robot. Comput. Integr. Manuf. 18(3–4), 223–231 (2002)
Lee, J.H., Yu, J.M., Lee, D.H.: A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness. Int. J. Adv. Manuf. Technol. 69(9–12), 2081–2089 (2013)
Lee, Y.H., Pinedo, M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100(3), 464–474 (1997)
Hassin, R., Shani, M.: Machine scheduling with earliness, tardiness and non-execution penalties. Comput. Oper. Res. 32(3), 683–705 (2005)
Acknowledgment
This work cannot be completed without the assistance of Kaan Özsümbül and Batuhan Uğuz. We are thankful for their contribution. Furthermore, we are grateful to the company for their co-operation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Duran, E. et al. (2020). The Uniform Parallel Machine Scheduling Problem: A Case Study. In: Durakbasa, N., Gençyılmaz, M. (eds) Proceedings of the International Symposium for Production Research 2019. ISPR ISPR 2019 2019. Lecture Notes in Mechanical Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-31343-2_69
Download citation
DOI: https://doi.org/10.1007/978-3-030-31343-2_69
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31342-5
Online ISBN: 978-3-030-31343-2
eBook Packages: EngineeringEngineering (R0)