{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:59:05Z","timestamp":1772668745196,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["AFB220003"],"award-info":[{"award-number":["AFB220003"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007351","name":"Secretaria de Ciencia y Tecnica, Universidad de Buenos Aires","doi-asserted-by":"publisher","award":["20020170100495BA"],"award-info":[{"award-number":["20020170100495BA"]}],"id":[{"id":"10.13039\/501100007351","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002923","name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","doi-asserted-by":"publisher","award":["11220200100084CO"],"award-info":[{"award-number":["11220200100084CO"]}],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10479-024-05938-1","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T08:01:55Z","timestamp":1714377715000},"page":"815-843","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An application of mathematical programming to a real case of the unrelated parallel machine problem"],"prefix":"10.1007","volume":"358","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8901-3734","authenticated-orcid":false,"given":"Guillermo A.","family":"Dur\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Dur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9007-7081","authenticated-orcid":false,"given":"Nazareno A.","family":"Faillace Mullen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Vel\u00e1squez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"5938_CR1","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/B978-0-12-381375-6.00017-6","volume-title":"Introduction to optimum design","author":"JS Arora","year":"2012","unstructured":"Arora, J. S. (2012). Multi-objective optimum design concepts and methods. In J. S. Arora (Ed.), Introduction to optimum design (3rd ed., pp. 657\u2013679). Academic Press.","edition":"3"},{"issue":"2","key":"5938_CR2","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1007\/s00170-014-6390-6","volume":"76","author":"O Avalos-Rosales","year":"2015","unstructured":"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\u20131718. https:\/\/doi.org\/10.1007\/s00170-014-6390-6","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"5938_CR3","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Springer.","edition":"5"},{"issue":"6","key":"5938_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.5772\/54381","volume":"9","author":"T \u00c7akar","year":"2012","unstructured":"\u00c7akar, T., K\u00f6ker, R., & Sar\u0131, 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","journal-title":"International Journal of Advanced Robotic Systems"},{"issue":"3","key":"5938_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"T Cheng","year":"1990","unstructured":"Cheng, T., & Sin, C. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271\u2013292. https:\/\/doi.org\/10.1016\/0377-2217(90)90215-W","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5938_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483\u2013495. https:\/\/doi.org\/10.1287\/moor.15.3.483","journal-title":"Mathematics of Operations Research"},{"key":"5938_CR7","doi-asserted-by":"publisher","unstructured":"\u0110urasevi\u0107, M., & Jakobovi\u0107, D. (2023). Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey. Artificial Intelligence Review,56(2), 3181\u20133289. https:\/\/doi.org\/10.1007\/s10462-022-10247-9","DOI":"10.1007\/s10462-022-10247-9"},{"key":"5938_CR8","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1016\/j.eswax.2020.100022"},{"issue":"2","key":"5938_CR9","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.ejor.2017.01.002","volume":"260","author":"L Fanjul-Peyro","year":"2017","unstructured":"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\u2013493. https:\/\/doi.org\/10.1016\/j.ejor.2017.01.002","journal-title":"European Journal of Operational Research"},{"key":"5938_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.cor.2018.07.007","volume":"101","author":"L Fanjul-Peyro","year":"2019","unstructured":"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\u2013182. https:\/\/doi.org\/10.1016\/j.cor.2018.07.007","journal-title":"Computers and Operations Research"},{"key":"5938_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-6272-8","volume-title":"Manufacturing scheduling systems: An integrated view on models, methods and tools","author":"JM Franiman","year":"2014","unstructured":"Franiman, J. M., Leisten, R. Ruiz., & Garc\u00eda, R. (2014). Manufacturing scheduling systems: An integrated view on models, methods and tools. Springer."},{"key":"5938_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.cie.2018.05.014","volume":"121","author":"R Gedik","year":"2018","unstructured":"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\u2013149. https:\/\/doi.org\/10.1016\/j.cie.2018.05.014","journal-title":"Computers and Industrial Engineering"},{"key":"5938_CR13","first-page":"287","volume-title":"Discrete optimization II","author":"R Graham","year":"1979","unstructured":"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\u2013326). New York: Elsevier."},{"issue":"8","key":"5938_CR14","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1057\/jors.1991.132","volume":"42","author":"A Guinet","year":"1991","unstructured":"Guinet, A. (1991). Textile production systems: A succession of non-identical parallel processor shops. Journal of the Operational Research Society, 42(8), 655\u2013671. https:\/\/doi.org\/10.1057\/jors.1991.132","journal-title":"Journal of the Operational Research Society"},{"key":"5938_CR15","volume-title":"Factory physics","author":"WJ Hopp","year":"2011","unstructured":"Hopp, W. J., & Spearman, M. L. (2011). Factory physics. Waveland Press Inc."},{"key":"5938_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114548","volume":"172","author":"K Jaklinovi\u0107","year":"2021","unstructured":"Jaklinovi\u0107, K., \u0110urasevi\u0107, M., & Jakobovi\u0107, D. (2021). Designing dispatching rules with genetic programming for the unrelated machines environment with constraints. Expert Systems with Applications, 172, 114548.","journal-title":"Expert Systems with Applications"},{"issue":"17","key":"5938_CR17","doi-asserted-by":"publisher","first-page":"5259","DOI":"10.1080\/00207543.2020.1775911","volume":"59","author":"D Lei","year":"2021","unstructured":"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\u20135271. https:\/\/doi.org\/10.1080\/00207543.2020.1775911","journal-title":"International Journal of Production Research"},{"key":"5938_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J Lenstra","year":"1990","unstructured":"Lenstra, J., Shmoys, D. B., & Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259\u2013271. https:\/\/doi.org\/10.1007\/BF01585745","journal-title":"Mathematical Programming"},{"key":"5938_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2013\/537127","volume":"2013","author":"C Liu","year":"2013","unstructured":"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\u201311. https:\/\/doi.org\/10.1155\/2013\/537127","journal-title":"Mathematical Problems in Engineering"},{"key":"5938_CR20","volume-title":"Practical production control: A survival guide for planners and schedulers","author":"KN McKay","year":"2004","unstructured":"McKay, K. N., & Wiers, V. (2004). Practical production control: A survival guide for planners and schedulers. J. Ross Publishing."},{"issue":"2","key":"5938_CR21","first-page":"193","volume":"56","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 56(2), 193\u2013242.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"3","key":"5938_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(01)00270-3","volume":"141","author":"E Mokotoff","year":"2002","unstructured":"Mokotoff, E., & Chr\u00e9tienne, P. (2002). A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research, 141(3), 515\u2013525.","journal-title":"European Journal of Operational Research"},{"key":"5938_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2012","unstructured":"Pinedo, M. L. (2012). Scheduling: Theory, algorithms, and systems. Springer."},{"key":"5938_CR24","doi-asserted-by":"crossref","unstructured":"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\u20131417). Association for Computing Machinery.","DOI":"10.1145\/3377929.3398150"},{"key":"5938_CR25","volume-title":"Machine scheduling problems: Classification, complexity and computations","author":"AHG Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: Classification, complexity and computations (Vol. 1). Springer."},{"key":"5938_CR26","first-page":"1","volume-title":"Handbook of heuristics","author":"R Ruiz","year":"2016","unstructured":"Ruiz, R. (2016). Scheduling heuristics. In R. Mart\u00ed, P. Panos, & M. G. Resende (Eds.), Handbook of heuristics (pp. 1\u201324). Springer."},{"key":"5938_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.119428","volume":"249","author":"H Soleimani","year":"2020","unstructured":"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","journal-title":"Journal of Cleaner Production"},{"issue":"8","key":"5938_CR28","doi-asserted-by":"publisher","first-page":"11118","DOI":"10.1016\/j.eswa.2009.02.071","volume":"36","author":"LY Tseng","year":"2009","unstructured":"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\u201311130.","journal-title":"Expert Systems with Applications"},{"key":"5938_CR29","doi-asserted-by":"publisher","first-page":"121223","DOI":"10.1109\/ACCESS.2019.2937747","volume":"7","author":"M Wang","year":"2019","unstructured":"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\u2013121235. https:\/\/doi.org\/10.1109\/ACCESS.2019.2937747","journal-title":"IEEE Access"},{"key":"5938_CR30","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ijpe.2018.04.013","volume":"201","author":"L Wu","year":"2018","unstructured":"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\u201340.","journal-title":"International Journal of Production Economics"},{"key":"5938_CR31","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s00170-006-0662-8","volume":"34","author":"Z Zhang","year":"2007","unstructured":"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\u2013980.","journal-title":"The International Journal of Advanced Manufacturing Technology"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05938-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-05938-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05938-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T11:04:10Z","timestamp":1772622250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-05938-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["5938"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-05938-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}