{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:27Z","timestamp":1775068887529,"version":"3.50.1"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00291-024-00778-8","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T16:05:46Z","timestamp":1720022746000},"page":"129-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost"],"prefix":"10.1007","volume":"47","author":[{"given":"Kai","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4808-4660","authenticated-orcid":false,"given":"Fulong","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Jianfu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"778_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jclepro.2018.10.048","volume":"208","author":"JB Abikarram","year":"2019","unstructured":"Abikarram JB, McConky K, Proano R (2019) Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing. J Clean Prod 208:232\u2013242. https:\/\/doi.org\/10.1016\/j.jclepro.2018.10.048","journal-title":"J Clean Prod"},{"issue":"2","key":"778_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi A (2015) The third comprehensive survey on scheduling problems with setup times\/costs. Eur J Oper Res 246(2):345\u2013378. https:\/\/doi.org\/10.1016\/j.ejor.2015.04.004","journal-title":"Eur J Oper Res"},{"issue":"3","key":"778_CR3","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Soroush H (2008) The significance of reducing setup times\/setup costs. Eur J Oper Res 187(3):978\u2013984. https:\/\/doi.org\/10.1016\/j.ejor.2006.09.010","journal-title":"Eur J Oper Res"},{"key":"778_CR4","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. Int J Adv Manuf Technol 76:1705\u20131718. https:\/\/doi.org\/10.1007\/s00170-014-6390-6","journal-title":"Int J Adv Manuf Technol"},{"issue":"16","key":"778_CR5","doi-asserted-by":"publisher","first-page":"5502","DOI":"10.1080\/00207543.2022.2102948","volume":"61","author":"I Avgerinos","year":"2023","unstructured":"Avgerinos I, Mourtos I, Vatikiotis S et al (2023) Scheduling unrelated machines with job splitting, setup resources and sequence dependency. Int J Prod Res 61(16):5502\u20135524. https:\/\/doi.org\/10.1080\/00207543.2022.2102948","journal-title":"Int J Prod Res"},{"key":"778_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.cor.2018.10.010","volume":"103","author":"G Bektur","year":"2019","unstructured":"Bektur G, Sara\u00e7 T (2019) A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server. Comput Op Res 103:46\u201363. https:\/\/doi.org\/10.1016\/j.cor.2018.10.010","journal-title":"Comput Op Res"},{"key":"778_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108736","volume":"174","author":"A Berthier","year":"2022","unstructured":"Berthier A, Yalaoui A, Chehade H et al (2022) Unrelated parallel machines scheduling with dependent setup times in textile industry. Comput Ind Eng 174:108736. https:\/\/doi.org\/10.1016\/j.cie.2022.108736","journal-title":"Comput Ind Eng"},{"issue":"4","key":"778_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10951-016-0485-x","volume":"20","author":"K B\u00fclb\u00fcl","year":"2017","unstructured":"B\u00fclb\u00fcl K, \u015een H (2017) An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J Sched 20(4):373\u2013389. https:\/\/doi.org\/10.1007\/s10951-016-0485-x","journal-title":"J Sched"},{"key":"778_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107915","volume":"165","author":"C Chen","year":"2022","unstructured":"Chen C, Fathi M, Khakifirooz M et al (2022) Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times. Comput Ind Eng 165:107915. https:\/\/doi.org\/10.1016\/j.cie.2021.107915","journal-title":"Comput Ind Eng"},{"key":"778_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2024.03.011","author":"J Chen","year":"2024","unstructured":"Chen J, Chu C, Sahli A et al (2024) A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs. Eur J Op Res. https:\/\/doi.org\/10.1016\/j.ejor.2024.03.011","journal-title":"Eur J Op Res"},{"issue":"7","key":"778_CR11","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1002\/nav.10091","volume":"50","author":"ZL Chen","year":"2003","unstructured":"Chen ZL, Powell WB (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Res Log 50(7):823\u2013840. https:\/\/doi.org\/10.1002\/nav.10091","journal-title":"Naval Res Log"},{"key":"778_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.cor.2016.06.017","volume":"76","author":"G Claassen","year":"2016","unstructured":"Claassen G, Gerdessen JC, Hendrix EM et al (2016) On production planning and scheduling in food processing industry: modelling non-triangular setups and product decay. Comput Op Res 76:147\u2013154. https:\/\/doi.org\/10.1016\/j.cor.2016.06.017","journal-title":"Comput Op Res"},{"issue":"3","key":"778_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Sevaux M (2003) Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Res Log 50(3):273\u2013288. https:\/\/doi.org\/10.1002\/nav.10056","journal-title":"Naval Res Log"},{"key":"778_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116097","volume":"189","author":"Prata B de Athayde","year":"2022","unstructured":"de Athayde Prata B, Rodrigues CD, Framinan JM (2022) A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Syst Appl 189:116097. https:\/\/doi.org\/10.1016\/j.eswa.2021.116097","journal-title":"Expert Syst Appl"},{"key":"778_CR15","volume-title":"Column generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation, vol 5. Springer, Berlin"},{"issue":"1","key":"778_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","volume":"10","author":"M Desrochers","year":"1991","unstructured":"Desrochers M, Laporte G (1991) Improvements and extensions to the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints. Oper Res Lett 10(1):27\u201336. https:\/\/doi.org\/10.1016\/0167-6377(91)90083-2","journal-title":"Oper Res Lett"},{"issue":"2","key":"778_CR17","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","volume":"13","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Zhang R et al (2015) Parallel machine scheduling under time-of-use electricity prices: New models and optimization approaches. IEEE Trans Autom Sci Eng 13(2):1138\u20131154. https:\/\/doi.org\/10.1109\/TASE.2015.2495328","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"3","key":"778_CR18","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.disopt.2010.02.005","volume":"7","author":"G D\u00f3sa","year":"2010","unstructured":"D\u00f3sa G, Tan Z (2010) New upper and lower bounds for online scheduling with machine cost. Discret Optim 7(3):125\u2013135. https:\/\/doi.org\/10.1016\/j.disopt.2010.02.005","journal-title":"Discret Optim"},{"key":"778_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.apm.2021.01.017","volume":"94","author":"AA Ewees","year":"2021","unstructured":"Ewees AA, Al-qaness MA, Abd Elaziz M (2021) Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Appl Math Model 94:285\u2013305. https:\/\/doi.org\/10.1016\/j.apm.2021.01.017","journal-title":"Appl Math Model"},{"key":"778_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108193","volume":"241","author":"W Fang","year":"2022","unstructured":"Fang W, Zhu H, Mei Y (2022) Hybrid meta-heuristics for the unrelated parallel machine scheduling problem with setup times. Knowl-Based Syst 241:108193. https:\/\/doi.org\/10.1016\/j.knosys.2022.108193","journal-title":"Knowl-Based Syst"},{"key":"778_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswax.2020.100022","volume":"5","author":"L Fanjul-Peyro","year":"2020","unstructured":"Fanjul-Peyro L (2020) Models and an exact method for the unrelated parallel machine scheduling problem with setups and resources. Exp Syst Appl X 5:100022. https:\/\/doi.org\/10.1016\/j.eswax.2020.100022","journal-title":"Exp Syst Appl X"},{"key":"778_CR22","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. Comput Op Res 101:173\u2013182. https:\/\/doi.org\/10.1016\/j.cor.2018.07.007","journal-title":"Comput Op Res"},{"issue":"6","key":"778_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1080\/0740817X.2013.851432","volume":"46","author":"NK Freeman","year":"2014","unstructured":"Freeman NK, Mittenthal J, Melouk SH (2014) Parallel-machine scheduling to minimize overtime and waste costs. IIE Trans 46(6):601\u2013618. https:\/\/doi.org\/10.1080\/0740817X.2013.851432","journal-title":"IIE Trans"},{"issue":"12","key":"778_CR24","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1016\/j.cor.2010.03.003","volume":"37","author":"B Gacias","year":"2010","unstructured":"Gacias B, Artigues C, Lopez P (2010) Parallel machine scheduling with precedence constraints and setup times. Comput Op Res 37(12):2141\u20132151. https:\/\/doi.org\/10.1016\/j.cor.2010.03.003","journal-title":"Comput Op Res"},{"key":"778_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Annals of discrete mathematics","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer PL, Johnson EL, Korte BH (eds) Annals of discrete mathematics, vol 5. Elsevier, Amsterdam, pp 287\u2013326. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X"},{"key":"778_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_3","volume-title":"Variable neighborhood search","author":"P Hansen","year":"2019","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J et al (2019) Variable neighborhood search. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-91086-4_3"},{"issue":"1","key":"778_CR27","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.ejor.2021.12.041","volume":"302","author":"M Heydar","year":"2022","unstructured":"Heydar M, Mardaneh E, Loxton R (2022) Approximate dynamic programming for an energy-efficient parallel machine scheduling problem. Eur J Oper Res 302(1):363\u2013380. https:\/\/doi.org\/10.1016\/j.ejor.2021.12.041","journal-title":"Eur J Oper Res"},{"key":"778_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.asoc.2015.01.028","volume":"30","author":"PH Hsieh","year":"2015","unstructured":"Hsieh PH, Yang SJ, Yang DL (2015) Decision support for unrelated parallel machine scheduling with discrete controllable processing times. Appl Soft Comput 30:475\u2013483. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.028","journal-title":"Appl Soft Comput"},{"key":"778_CR29","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.rcim.2019.01.010","volume":"58","author":"Y Hu","year":"2019","unstructured":"Hu Y, Zhu F, Zhang L et al (2019) Scheduling of manufacturers based on chaos optimization algorithm in cloud manufacturing. Robot Comput Integr Manuf 58:13\u201320. https:\/\/doi.org\/10.1016\/j.rcim.2019.01.010","journal-title":"Robot Comput Integr Manuf"},{"key":"778_CR30","doi-asserted-by":"publisher","unstructured":"Imreh C, Noga J (1999) Scheduling with machine cost. In: International workshop on randomization and approximation techniques in computer science, Springer, pp 168\u2013176, https:\/\/doi.org\/10.1007\/978-3-540-48413-4_18","DOI":"10.1007\/978-3-540-48413-4_18"},{"key":"778_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic R, Vo\u00df S (2021) Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl Soft Comput 110:107521. https:\/\/doi.org\/10.1016\/j.asoc.2021.107521","journal-title":"Appl Soft Comput"},{"issue":"18","key":"778_CR32","doi-asserted-by":"publisher","first-page":"5438","DOI":"10.1080\/00207543.2020.1781278","volume":"59","author":"J Kim","year":"2021","unstructured":"Kim J, Kim HJ (2021) Parallel machine scheduling with multiple processing alternatives and sequence-dependent setup times. Int J Prod Res 59(18):5438\u20135453. https:\/\/doi.org\/10.1080\/00207543.2020.1781278","journal-title":"Int J Prod Res"},{"issue":"2","key":"778_CR33","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TSM.2010.2045666","volume":"23","author":"YD Kim","year":"2010","unstructured":"Kim YD, Joo BJ, Choi SY (2010) Scheduling wafer lots on diffusion machines in a semiconductor wafer fabrication facility. IEEE Trans Semicond Manuf 23(2):246\u2013254. https:\/\/doi.org\/10.1109\/TSM.2010.2045666","journal-title":"IEEE Trans Semicond Manuf"},{"key":"778_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105018","volume":"123","author":"A Kramer","year":"2020","unstructured":"Kramer A, Dell\u2019Amico M, Feillet D et al (2020) Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. Comput Op Res 123:105018. https:\/\/doi.org\/10.1016\/j.cor.2020.105018","journal-title":"Comput Op Res"},{"issue":"3","key":"778_CR35","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2019.07.006","volume":"289","author":"A Kramer","year":"2021","unstructured":"Kramer A, Iori M, Lacomme P (2021) Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization. Eur J Oper Res 289(3):825\u2013840. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.006","journal-title":"Eur J Oper Res"},{"key":"778_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109154","volume":"125","author":"D Lei","year":"2022","unstructured":"Lei D, Yang H (2022) Scheduling unrelated parallel machines with preventive maintenance and setup time: multi-sub-colony artificial bee colony. Appl Soft Comput 125:109154. https:\/\/doi.org\/10.1016\/j.asoc.2022.109154","journal-title":"Appl Soft Comput"},{"key":"778_CR37","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra JK, Shmoys DB, Tardos \u00c9 (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259\u2013271. https:\/\/doi.org\/10.1007\/BF01585745","journal-title":"Math Program"},{"key":"778_CR38","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jmsy.2015.11.006","volume":"38","author":"K Li","year":"2016","unstructured":"Li K, Zhang X, Leung JYT et al (2016) Parallel machine scheduling problems in green manufacturing industry. J Manuf Syst 38:98\u2013106. https:\/\/doi.org\/10.1016\/j.jmsy.2015.11.006","journal-title":"J Manuf Syst"},{"key":"778_CR39","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11590-016-1096-3","volume":"12","author":"K Li","year":"2018","unstructured":"Li K, Zhang HJ, Cheng BY et al (2018) Uniform parallel machine scheduling problems with fixed machine cost. Optim Lett 12:73\u201386. https:\/\/doi.org\/10.1007\/s11590-016-1096-3","journal-title":"Optim Lett"},{"issue":"4","key":"778_CR40","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1080\/00207543.2013.848305","volume":"52","author":"YK Lin","year":"2014","unstructured":"Lin YK, Hsieh FY (2014) Unrelated parallel machine scheduling with setup times and ready times. Int J Prod Res 52(4):1200\u20131214. https:\/\/doi.org\/10.1080\/00207543.2013.848305","journal-title":"Int J Prod Res"},{"issue":"15\u201316","key":"778_CR41","doi-asserted-by":"publisher","first-page":"4854","DOI":"10.1080\/00207543.2018.1449978","volume":"57","author":"Y Liu","year":"2019","unstructured":"Liu Y, Wang L, Wang XV et al (2019) Scheduling in cloud manufacturing: state-of-the-art and research challenges. Int J Prod Res 57(15\u201316):4854\u20134879. https:\/\/doi.org\/10.1080\/00207543.2018.1449978","journal-title":"Int J Prod Res"},{"issue":"20","key":"778_CR42","doi-asserted-by":"publisher","first-page":"6104","DOI":"10.1080\/00207543.2021.1983224","volume":"60","author":"Y Li","year":"2022","unstructured":"Li Y, C\u00f4t\u00e9 JF, Coelho LC et al (2022) Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates. Int J Prod Res 60(20):6104\u20136123. https:\/\/doi.org\/10.1080\/00207543.2021.1983224","journal-title":"Int J Prod Res"},{"key":"778_CR43","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00170-015-7657-2","volume":"84","author":"Z Li","year":"2016","unstructured":"Li Z, Yang H, Zhang S et al (2016) Unrelated parallel machine scheduling problem with energy and tardiness cost. Int J Adv Manuf Technol 84:213\u2013226. https:\/\/doi.org\/10.1007\/s00170-015-7657-2","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"778_CR44","doi-asserted-by":"publisher","first-page":"3420","DOI":"10.1016\/j.cor.2006.02.006","volume":"34","author":"R Logendran","year":"2007","unstructured":"Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput Op Res 34(11):3420\u20133438. https:\/\/doi.org\/10.1016\/j.cor.2006.02.006","journal-title":"Comput Op Res"},{"issue":"3","key":"778_CR45","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"MJP Lopes","year":"2007","unstructured":"Lopes MJP, de Carvalho JV (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176(3):1508\u20131527. https:\/\/doi.org\/10.1016\/j.ejor.2005.11.001","journal-title":"Eur J Oper Res"},{"issue":"17","key":"778_CR46","doi-asserted-by":"publisher","first-page":"6013","DOI":"10.1080\/00207543.2022.2121869","volume":"61","author":"A Lopez-Esteve","year":"2023","unstructured":"Lopez-Esteve A, Perea F, Yepes-Borrero JC (2023) Grasp algorithms for the unrelated parallel machines scheduling problem with additional resources during processing and setups. Int J Prod Res 61(17):6013\u20136029. https:\/\/doi.org\/10.1080\/00207543.2022.2121869","journal-title":"Int J Prod Res"},{"issue":"1\u20132","key":"778_CR47","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10479-019-03267-2","volume":"285","author":"S Maecker","year":"2020","unstructured":"Maecker S, Shen L (2020) Solving parallel machine problems with delivery times and tardiness objectives. Ann Oper Res 285(1\u20132):315\u2013334. https:\/\/doi.org\/10.1007\/s10479-019-03267-2","journal-title":"Ann Oper Res"},{"key":"778_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105999","volume":"149","author":"S Maecker","year":"2023","unstructured":"Maecker S, Shen L, M\u00f6nch L (2023) Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. Comput Op Res 149:105999. https:\/\/doi.org\/10.1016\/j.cor.2022.105999","journal-title":"Comput Op Res"},{"issue":"4","key":"778_CR49","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329. https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J ACM"},{"issue":"11","key":"778_CR50","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Op Res 24(11):1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput Op Res"},{"issue":"5","key":"778_CR51","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma CL, Potts CN (1989) On the complexity of scheduling with batch setup times. Oper Res 37(5):798\u2013804. https:\/\/doi.org\/10.1287\/opre.37.5.798","journal-title":"Oper Res"},{"key":"778_CR52","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison DR, Jacobson SH, Sauppe JJ et al (2016) Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning. Discret Optim 19:79\u2013102. https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret Optim"},{"issue":"5","key":"778_CR53","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10951-021-00714-6","volume":"25","author":"M Moser","year":"2022","unstructured":"Moser M, Musliu N, Schaerf A et al (2022) Exact and metaheuristic approaches for unrelated parallel machine scheduling. J Sched 25(5):507\u2013534. https:\/\/doi.org\/10.1007\/s10951-021-00714-6","journal-title":"J Sched"},{"key":"778_CR54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling","author":"ML Pinedo","year":"2012","unstructured":"Pinedo ML (2012) Scheduling, vol 29. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-26580-3"},{"key":"778_CR55","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.cor.2018.12.020","volume":"104","author":"G Rauchecker","year":"2019","unstructured":"Rauchecker G, Schryen G (2019) Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm. Comput Op Res 104:338\u2013357. https:\/\/doi.org\/10.1016\/j.cor.2018.12.020","journal-title":"Comput Op Res"},{"issue":"5","key":"778_CR56","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1057\/jors.2009.38","volume":"61","author":"AJ Ruiz-Torres","year":"2010","unstructured":"Ruiz-Torres AJ, L\u00f3pez FJ, Wojciechowski PJ et al (2010) Parallel machine scheduling problems considering regular measures of performance and machine cost. J Op Res Soc 61(5):849\u2013857. https:\/\/doi.org\/10.1057\/jors.2009.38","journal-title":"J Op Res Soc"},{"issue":"5","key":"778_CR57","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1287\/opre.2013.1208","volume":"61","author":"K Rustogi","year":"2013","unstructured":"Rustogi K, Strusevich VA (2013) Parallel machine scheduling: impact of adding extra machines. Oper Res 61(5):1243\u20131257. https:\/\/doi.org\/10.1287\/opre.2013.1208","journal-title":"Oper Res"},{"issue":"1","key":"778_CR58","doi-asserted-by":"publisher","first-page":"33","DOI":"10.5267\/j.ijiec.2022.10.004","volume":"14","author":"H Safarzadeh","year":"2023","unstructured":"Safarzadeh H, Niaki S (2023) Unrelated parallel machine scheduling with machine processing cost. Int J Ind Eng Comput 14(1):33\u201348. https:\/\/doi.org\/10.5267\/j.ijiec.2022.10.004","journal-title":"Int J Ind Eng Comput"},{"issue":"2","key":"778_CR59","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"EV Shchepin","year":"2005","unstructured":"Shchepin EV, Vakhania N (2005) An optimal rounding gives a better approximation for scheduling unrelated machines. Oper Res Lett 33(2):127\u2013133. https:\/\/doi.org\/10.1016\/j.orl.2004.05.004","journal-title":"Oper Res Lett"},{"issue":"1\u20132","key":"778_CR60","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.cie.2006.01.001","volume":"50","author":"C Silva","year":"2006","unstructured":"Silva C, Magalhaes JM (2006) Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Comput Ind Eng 50(1\u20132):76\u201389. https:\/\/doi.org\/10.1016\/j.cie.2006.01.001","journal-title":"Comput Ind Eng"},{"key":"778_CR61","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa JP, Wolsey LA (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math Program 54:353\u2013367. https:\/\/doi.org\/10.1007\/BF01586059","journal-title":"Math Program"},{"issue":"2","key":"778_CR62","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00291-020-00586-w","volume":"42","author":"G Tadumadze","year":"2020","unstructured":"Tadumadze G, Emde S, Diefenbach H (2020) Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines. OR Spectrum 42(2):461\u2013497. https:\/\/doi.org\/10.1007\/s00291-020-00586-w","journal-title":"OR Spectrum"},{"key":"778_CR63","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10845-013-0811-5","volume":"26","author":"RF Tavares Neto","year":"2015","unstructured":"Tavares Neto RF, Godinho Filho M, Da Silva FM (2015) An ant colony optimization approach for the parallel machine scheduling problem with outsourcing allowed. J Intell Manuf 26:527\u2013538. https:\/\/doi.org\/10.1007\/s10845-013-0811-5","journal-title":"J Intell Manuf"},{"issue":"3","key":"778_CR64","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","volume":"211","author":"E Vallada","year":"2011","unstructured":"Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612\u2013622. https:\/\/doi.org\/10.1016\/j.ejor.2011.01.011","journal-title":"Eur J Oper Res"},{"issue":"2","key":"778_CR65","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J Van den Akker","year":"2000","unstructured":"Van den Akker J, Hurkens CA, Savelsbergh MW (2000) Time-indexed formulations for machine scheduling problems column generation. INFORMS J Comput 12(2):111\u2013124. https:\/\/doi.org\/10.1287\/ijoc.12.2.111.11896","journal-title":"INFORMS J Comput"},{"issue":"6","key":"778_CR66","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"JM van Den Akker","year":"1999","unstructured":"van Den Akker JM, Hoogeveen JA, van de Velde SL (1999) Parallel machine scheduling by column generation. Oper Res 47(6):862\u2013872. https:\/\/doi.org\/10.1287\/opre.47.6.862","journal-title":"Oper Res"},{"issue":"4","key":"778_CR67","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6377(96)00033-8","volume":"19","author":"F Vanderbeck","year":"1996","unstructured":"Vanderbeck F, Wolsey LA (1996) An exact algorithm for ip column generation. Oper Res Lett 19(4):151\u2013159. https:\/\/doi.org\/10.1016\/0167-6377(96)00033-8","journal-title":"Oper Res Lett"},{"key":"778_CR68","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.omega.2018.07.005","volume":"83","author":"H Wang","year":"2019","unstructured":"Wang H, Alidaee B (2019) Effective heuristic for large-scale unrelated parallel machines scheduling problems. Omega 83:261\u2013274. https:\/\/doi.org\/10.1016\/j.omega.2018.07.005","journal-title":"Omega"},{"key":"778_CR69","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.cor.2018.12.016","volume":"104","author":"S Wang","year":"2019","unstructured":"Wang S, Ye B (2019) Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput Op Res 104:159\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2018.12.016","journal-title":"Comput Op Res"},{"key":"778_CR70","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105990","volume":"148","author":"S Wang","year":"2022","unstructured":"Wang S, Wu R, Chu F et al (2022) Unrelated parallel machine scheduling problem with special controllable processing times and setups. Comput Op Res 148:105990. https:\/\/doi.org\/10.1016\/j.cor.2022.105990","journal-title":"Comput Op Res"},{"key":"778_CR71","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108899","volume":"175","author":"S Wang","year":"2023","unstructured":"Wang S, Wu R, Chu F et al (2023) An exact decomposition method for unrelated parallel machine scheduling with order acceptance and setup times. Comput Ind Eng 175:108899. https:\/\/doi.org\/10.1016\/j.cie.2022.108899","journal-title":"Comput Ind Eng"},{"key":"778_CR72","volume-title":"Operations research: applications and algorithms","author":"WL Winston","year":"2022","unstructured":"Winston WL (2022) Operations research: applications and algorithms. Cengage Learning, Boston"},{"key":"778_CR73","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jmsy.2022.02.007","volume":"63","author":"Q Wu","year":"2022","unstructured":"Wu Q, Xie N, Zheng S et al (2022) Online order scheduling of multi 3d printing tasks based on the additive manufacturing cloud platform. J Manuf Syst 63:23\u201334. https:\/\/doi.org\/10.1016\/j.jmsy.2022.02.007","journal-title":"J Manuf Syst"},{"key":"778_CR74","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2021.102567","volume":"108","author":"J Xu","year":"2022","unstructured":"Xu J, Wang JQ, Liu Z (2022) Parallel batch scheduling: impact of increasing machine capacity. Omega 108:102567. https:\/\/doi.org\/10.1016\/j.omega.2021.102567","journal-title":"Omega"},{"key":"778_CR75","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112959","volume":"141","author":"JC Yepes-Borrero","year":"2020","unstructured":"Yepes-Borrero JC, Villa F, Perea F et al (2020) Grasp algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Expert Syst Appl 141:112959. https:\/\/doi.org\/10.1016\/j.eswa.2019.112959","journal-title":"Expert Syst Appl"},{"key":"778_CR76","doi-asserted-by":"publisher","first-page":"1795","DOI":"10.1007\/s10845-010-0483-3","volume":"23","author":"KC Ying","year":"2012","unstructured":"Ying KC, Lee ZJ, Lin SW (2012) Makespan minimization for scheduling unrelated parallel machines with setup times. J Intell Manuf 23:1795\u20131803. https:\/\/doi.org\/10.1007\/s10845-010-0483-3","journal-title":"J Intell Manuf"},{"key":"778_CR77","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-018-0583-z","volume":"22","author":"Y Yin","year":"2019","unstructured":"Yin Y, Chen Y, Qin K et al (2019) Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria. J Sched 22:315\u2013333. https:\/\/doi.org\/10.1007\/s10951-018-0583-z","journal-title":"J Sched"},{"key":"778_CR78","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"C Yu","year":"2018","unstructured":"Yu C, Semeraro Q, Matta A (2018) A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput Op Res 100:211\u2013229. https:\/\/doi.org\/10.1016\/j.cor.2018.07.025","journal-title":"Comput Op Res"},{"issue":"6","key":"778_CR79","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1080\/01605682.2019.1595190","volume":"71","author":"A Zandi","year":"2020","unstructured":"Zandi A, Ramezanian R, Monplaisir L (2020) Green parallel machines scheduling problem: a bi-objective model and a heuristic algorithm to obtain pareto frontier. J Op Res Soc 71(6):967\u2013978. https:\/\/doi.org\/10.1080\/01605682.2019.1595190","journal-title":"J Op Res Soc"},{"issue":"1","key":"778_CR80","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/0305215X.2017.1296437","volume":"50","author":"Y Zeng","year":"2018","unstructured":"Zeng Y, Che A, Wu X (2018) Bi-objective scheduling on uniform parallel machines considering electricity cost. Eng Optim 50(1):19\u201336. https:\/\/doi.org\/10.1080\/0305215X.2017.1296437","journal-title":"Eng Optim"},{"key":"778_CR81","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105899","volume":"146","author":"H Zhang","year":"2022","unstructured":"Zhang H, Li K, Chu C et al (2022) Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time. Comput Op Res 146:105899. https:\/\/doi.org\/10.1016\/j.cor.2022.105899","journal-title":"Comput Op Res"},{"issue":"22","key":"778_CR82","doi-asserted-by":"publisher","first-page":"6826","DOI":"10.1080\/00207543.2019.1685708","volume":"58","author":"L Zhang","year":"2020","unstructured":"Zhang L, Deng Q, Gong G et al (2020) A new unrelated parallel machine scheduling problem with tool changes to minimise the total energy consumption. Int J Prod Res 58(22):6826\u20136845. https:\/\/doi.org\/10.1080\/00207543.2019.1685708","journal-title":"Int J Prod Res"},{"issue":"2","key":"778_CR83","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1007\/s10878-022-00882-x","volume":"44","author":"F Zheng","year":"2022","unstructured":"Zheng F, Chen Y, Liu M et al (2022) Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence. J Comb Optim 44(2):1060\u20131076. https:\/\/doi.org\/10.1007\/s10878-022-00882-x","journal-title":"J Comb Optim"},{"key":"778_CR84","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108483","volume":"171","author":"F Zheng","year":"2022","unstructured":"Zheng F, Jin K, Xu Y et al (2022) Unrelated parallel machine scheduling with processing cost, machine eligibility and order splitting. Comput Ind Eng 171:108483. https:\/\/doi.org\/10.1016\/j.cie.2022.108483","journal-title":"Comput Ind Eng"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00778-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-024-00778-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-024-00778-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T09:22:10Z","timestamp":1741771330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-024-00778-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":84,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s00291-024-00778-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"16 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 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":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}