Abstract
Mathematical programming techniques are used in a tool developed to solve a real unrelated parallel machine problem in a bottle closures manufacturing plant. The tool is able to define the production process planning for a scheduling horizon of up to one month while satisfying all relevant constraints. The planning problem is a multi-objective one of minimizing production completion times, overproduction and machine idle time. Due to the problem’s complexity, the approach adopted for obtaining good solutions in reasonable execution times is based on dividing it into three subproblems or stages, each solved by a different MILP model. In the first stage, the model performs a lexicographic minimization to assign closure injection molds to the plant’s machines; in the second stage, the model corrects the machine stoppage times for mold changes; and in the third stage, the model determines the assignment of different colors to the closures or its parts produced with a given mold. Results are presented for instances of up to 100 jobs, showing how different characteristics of the problem influence the performance of the proposed solution approach. A comparison is also presented between our model’s result and the manual scheduling carried out by the factory staff for a real instance, demonstrating that our method enabled significant enhancements in the aforementioned objectives.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arora, J. S. (2012). Multi-objective optimum design concepts and methods. In J. S. Arora (Ed.), Introduction to optimum design (3rd ed., pp. 657–679). Academic Press.
Avalos-Rosales, O., Angel-Bello, F., & Alvarez, A. (2015). Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. The International Journal of Advanced Manufacturing Technology, 76(2), 1705–1718. https://doi.org/10.1007/s00170-014-6390-6
Brucker, P. (2007). Scheduling algorithms (5th ed.). Springer.
Çakar, T., Köker, R., & Sarı, Y. (2012). Parallel robot scheduling to minimize mean tardiness with unequal release date and precedence constraints using a hybrid intelligent system. International Journal of Advanced Robotic Systems, 9(6), 252. https://doi.org/10.5772/54381
Cheng, T., & Sin, C. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271–292. https://doi.org/10.1016/0377-2217(90)90215-W
Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483–495. https://doi.org/10.1287/moor.15.3.483
Đurasević, M., & Jakobović, D. (2023). Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artificial Intelligence Review,56(2), 3181–3289. https://doi.org/10.1007/s10462-022-10247-9
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,5100022. https://doi.org/10.1016/j.eswax.2020.100022
Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research, 260(2), 482–493. https://doi.org/10.1016/j.ejor.2017.01.002
Fanjul-Peyro, L., Ruiz, R., & Perea, F. (2019). Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Computers and Operations Research, 101, 173–182. https://doi.org/10.1016/j.cor.2018.07.007
Franiman, J. M., Leisten, R. Ruiz., & García, R. (2014). Manufacturing scheduling systems: An integrated view on models, methods and tools. Springer.
Gedik, R., Kalathia, D., Egilmez, G., & Kirac, E. (2018). A constraint programming approach for solving unrelated parallel machine scheduling problem. Computers and Industrial Engineering, 121, 139–149. https://doi.org/10.1016/j.cie.2018.05.014
Graham, R., Lawler, E., Lenstra, J., & Rinnooy Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In P. Hammer, E. Johnson, & B. Korte (Eds.), Discrete optimization II (Vol. 5, pp. 287–326). New York: Elsevier.
Guinet, A. (1991). Textile production systems: A succession of non-identical parallel processor shops. Journal of the Operational Research Society, 42(8), 655–671. https://doi.org/10.1057/jors.1991.132
Hopp, W. J., & Spearman, M. L. (2011). Factory physics. Waveland Press Inc.
Jaklinović, K., Đurasević, M., & Jakobović, D. (2021). Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Expert Systems with Applications, 172, 114548.
Lei, D., Yuan, Y., & Cai, J. (2021). An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling. International Journal of Production Research, 59(17), 5259–5271. https://doi.org/10.1080/00207543.2020.1775911
Lenstra, J., Shmoys, D. B., & Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259–271. https://doi.org/10.1007/BF01585745
Liu, C. (2013). A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints. Mathematical Problems in Engineering, 2013, 1–11. https://doi.org/10.1155/2013/537127
McKay, K. N., & Wiers, V. (2004). Practical production control: A survival guide for planners and schedulers. J. Ross Publishing.
Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 56(2), 193–242.
Mokotoff, E., & Chrétienne, P. (2002). A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research, 141(3), 515–525.
Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems. Springer.
Pinheiro, J. C. S. N. , Arroyo, J. E. C. & Fialho, L. B. (2020). Scheduling unrelated parallel machines with family setups and resource constraints to minimize total tardiness. In Proceedings of the 2020 genetic and evolutionary computation conference companion (pp. 1409–1417). Association for Computing Machinery.
Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: Classification, complexity and computations (Vol. 1). Springer.
Ruiz, R. (2016). Scheduling heuristics. In R. Martí, P. Panos, & M. G. Resende (Eds.), Handbook of heuristics (pp. 1–24). Springer.
Soleimani, H., Ghaderi, H., Tsai, P. W., Zarbakhshnia, N., & Maleki, M. (2020). Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. Journal of Cleaner Production, 249, 119428. https://doi.org/10.1016/j.jclepro.2019.119428
Tseng, L. Y., Chin, Y. H., & Wang, S. C. (2009). A minimized makespan scheduler with multiple factors for Grid computing systems. Expert Systems with Applications, 36(8), 11118–11130.
Wang, M., & Pan, G. (2019). A novel imperialist competitive algorithm with multi-elite individuals guidance for multi-object unrelated parallel machine scheduling problem. IEEE Access, 7, 121223–121235. https://doi.org/10.1109/ACCESS.2019.2937747
Wu, L., & Wang, S. (2018). Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. International Journal of Production Economics, 201, 26–40.
Zhang, Z., Zheng, L., & Weng, M. X. (2007). Dynamic parallel machine scheduling with mean weighted tardiness objective by q-learning. The International Journal of Advanced Manufacturing Technology, 34, 968–980.
Acknowledgements
The project reported here was the result of a joint effort between the Instituto de Cálculo de la Facultad de Ciencias Exactas y Naturales at the University of Buenos Aires and Tapi South America. The authors are grateful to Tapi South America officials Mariano Paz, general manager; Guillermo Bautista, plant manager; and Javier Romero González, planning manager, for their constant collaboration and willing provision of the data necessary to carry out the project. Our thanks also go to Sergio Messora, IT Manager at Tapi South America, for his technical support, to Simón Faillace Mullen for his participation in the design of the proposed tool’s user interface and to Kenneth Rivkin for his suggestions that improved the final version of this article.
Funding
Partial funding for the preparation of this article was provided by the Department of Industrial Engineering at the University of Chile, the Instituto Sistemas Complejos de Ingeniería (ISCI) in Santiago, Chile (ANID PIA/PUENTE AFB220003), UBACyT grant 20020170100495BA (UBA, Argentina) and PIP-CONICET grant 11220200100084CO (Mincyt, Argentina).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Durán, G.A., Durán, M., Faillace Mullen, N.A. et al. An application of mathematical programming to a real case of the unrelated parallel machine problem. Ann Oper Res (2024). https://doi.org/10.1007/s10479-024-05938-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10479-024-05938-1