{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:34:57Z","timestamp":1776976497675,"version":"3.51.4"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10288-023-00547-3","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T15:04:30Z","timestamp":1689779070000},"page":"351-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimization of maximum lateness on parallel machines with a single server and job release dates"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5024-6610","authenticated-orcid":false,"given":"Abdelhak","family":"Elidrissi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[]},{"given":"Mohammed","family":"Benbrahim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4856-7626","authenticated-orcid":false,"given":"David","family":"Duvivier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"issue":"3","key":"547_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"AH Abdekhodaee","year":"2002","unstructured":"Abdekhodaee AH, Wirth A (2002) Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput Oper Res 29(3):295\u2013315","journal-title":"Comput Oper Res"},{"issue":"11","key":"547_CR2","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1016\/S0305-0548(03)00144-8","volume":"31","author":"AH Abdekhodaee","year":"2004","unstructured":"Abdekhodaee AH, Wirth A, Gan HS (2004) Equal processing and equal setup time cases of scheduling parallel machines with a single server. Comput Oper Res 31(11):1867\u20131889","journal-title":"Comput Oper Res"},{"issue":"4","key":"547_CR3","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.cor.2004.08.013","volume":"33","author":"AH Abdekhodaee","year":"2006","unstructured":"Abdekhodaee AH, Wirth A, Gan HS (2006) Scheduling two parallel machines with a single server: the general case. Comput Oper Res 33(4):994\u20131009","journal-title":"Comput Oper Res"},{"issue":"5","key":"547_CR4","first-page":"330","volume":"32","author":"I Alharkan","year":"2020","unstructured":"Alharkan I, Saleh M, Ghaleb MA, Kaid H, Farhan A, Almarfadi A (2020) Tabu search and particle swarm optimization algorithms for two identical parallel machines scheduling problem with a single server. J King Saud Univ-Eng Sci 32(5):330\u2013338","journal-title":"J King Saud Univ-Eng Sci"},{"issue":"3","key":"547_CR5","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","journal-title":"Eur J Oper Res"},{"issue":"3\u20134","key":"547_CR6","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.mcm.2012.06.029","volume":"57","author":"BE Anderson","year":"2013","unstructured":"Anderson BE, Blocher JD, Bretthauer KM, Venkataramanan MA (2013) An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines. Math Comput Model 57(3\u20134):483\u2013493","journal-title":"Math Comput Model"},{"issue":"1","key":"547_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ejor.2006.09.077","volume":"183","author":"VA Armentano","year":"2007","unstructured":"Armentano VA, de Franca Filho MF (2007) Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach. Eur J Oper Res 183(1):100\u2013114","journal-title":"Eur J Oper Res"},{"issue":"6","key":"547_CR8","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1111\/itor.12302","volume":"24","author":"JP Arnaout","year":"2017","unstructured":"Arnaout JP (2017) Heuristics for the two-machine scheduling problem with a single server. Int Trans Oper Res 24(6):1347\u20131355","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"547_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1504\/IJOR.2021.115628","volume":"41","author":"JP Arnaout","year":"2021","unstructured":"Arnaout JP (2021) Worm optimisation algorithm to minimise the makespan for the two-machine scheduling problem with a single server. Int J Oper Res 41(2):270\u2013281","journal-title":"Int J Oper Res"},{"key":"547_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.cie.2019.03.051","volume":"131","author":"S B\u00e1ez","year":"2019","unstructured":"B\u00e1ez S, Angel-Bello F, Alvarez A, Meli\u00e1n-Batista B (2019) A hybrid metaheuristic algorithm for a parallel machine scheduling problem with dependent setup times. Comput Ind Eng 131:295\u2013305","journal-title":"Comput Ind Eng"},{"issue":"4","key":"547_CR11","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.cie.2010.07.028","volume":"59","author":"KR Baker","year":"2010","unstructured":"Baker KR, Keller B (2010) Solving the single-machine sequencing problem using integer programming. Comput Ind Eng 59(4):730\u2013735","journal-title":"Comput Ind Eng"},{"key":"547_CR12","doi-asserted-by":"crossref","unstructured":"Balas E (1985) On the facial structure of scheduling polyhedra. In: Mathematical programming essays in honor of George B. Dantzig Part I. Springer, pp 179\u2013218","DOI":"10.1007\/BFb0121051"},{"key":"547_CR13","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 Oper Res 103:46\u201363","journal-title":"Comput Oper Res"},{"key":"547_CR14","doi-asserted-by":"crossref","unstructured":"Benmansour R, Braun O, Artiba A (2014) On the single-processor scheduling problem with time restrictions. In: 2014 international conference on control, decision and information technologies (CoDIT). IEEE, pp 242\u2013245","DOI":"10.1109\/CoDIT.2014.6996900"},{"key":"547_CR15","first-page":"1","volume":"22","author":"R Benmansour","year":"2018","unstructured":"Benmansour R, Braun O, Hanafi S (2018) The single-processor scheduling problem with time restrictions: complexity and related problems. J Sched 22:1\u20137","journal-title":"J Sched"},{"issue":"1","key":"547_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1287\/ijoc.1090.0343","volume":"22","author":"M Bierlaire","year":"2010","unstructured":"Bierlaire M, Th\u00e9mans M, Zufferey N (2010) A heuristic for nonlinear global optimization. INFORMS J Comput 22(1):59\u201370","journal-title":"INFORMS J Comput"},{"issue":"1","key":"547_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0377-2217(01)00382-4","volume":"144","author":"EK Bish","year":"2003","unstructured":"Bish EK (2003) A multiple-crane-constrained scheduling problem in a container terminal. Eur J Oper Res 144(1):83\u2013107","journal-title":"Eur J Oper Res"},{"issue":"4","key":"547_CR18","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10951-013-0342-0","volume":"17","author":"O Braun","year":"2014","unstructured":"Braun O, Chung F, Graham R (2014) Single-processor scheduling with time restrictions. J Sched 17(4):399\u2013403","journal-title":"J Sched"},{"issue":"6","key":"547_CR19","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/jos.120","volume":"5","author":"P Brucker","year":"2002","unstructured":"Brucker P, Dhaenens-Flipo C, Knust S, Kravchenko SA, Werner F (2002) Complexity results for parallel machine problems with a single server. J Sched 5(6):429\u2013457","journal-title":"J Sched"},{"issue":"1\u20132","key":"547_CR20","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0360-8352(97)00091-0","volume":"33","author":"G Centeno","year":"1997","unstructured":"Centeno G, Armacost RL (1997) Parallel machine scheduling with release time and machine eligibility restrictions. Comput Ind Eng 33(1\u20132):273\u2013276","journal-title":"Comput Ind Eng"},{"issue":"5","key":"547_CR21","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1002\/nav.21762","volume":"64","author":"T Cheng","year":"2017","unstructured":"Cheng T, Kravchenko SA, Lin BM (2017) Preemptive parallel-machine scheduling with a common server to minimize makespan. Naval Res Logist 64(5):388\u2013398","journal-title":"Naval Res Logist"},{"issue":"4","key":"547_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/nav.21846","volume":"66","author":"T Cheng","year":"2019","unstructured":"Cheng T, Kravchenko SA, Lin BM (2019) Server scheduling on parallel dedicated machines with fixed job sequences. Naval Res Logist (NRL) 66(4):321\u2013332","journal-title":"Naval Res Logist (NRL)"},{"issue":"10","key":"547_CR23","doi-asserted-by":"publisher","first-page":"2286","DOI":"10.1080\/01605682.2020.1779625","volume":"72","author":"T Cheng","year":"2021","unstructured":"Cheng T, Kravchenko SA, Lin BM (2021) Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. J Oper Res Soc 72(10):2286\u20132289","journal-title":"J Oper Res Soc"},{"key":"547_CR24","doi-asserted-by":"crossref","unstructured":"Elidrissi A, Benmansour R, Benbrahim M, Duvivier D (2018) MIP formulations for identical parallel machine scheduling problem with single server. In: 2018 4th international conference on optimization and applications (ICOA). IEEE, pp 1\u20136","DOI":"10.1109\/ICOA.2018.8370596"},{"key":"547_CR25","doi-asserted-by":"crossref","unstructured":"Elidrissi A, Benbrahim M, Benmansour R, Duvivier D (2019) Variable neighborhood search for identical parallel machine scheduling problem with a single server. In: International conference on variable neighborhood search. Springer, pp 112\u2013125","DOI":"10.1007\/978-3-030-44932-2_8"},{"issue":"20","key":"547_CR26","doi-asserted-by":"publisher","first-page":"6166","DOI":"10.1080\/00207543.2020.1807637","volume":"59","author":"A Elidrissi","year":"2021","unstructured":"Elidrissi A, Benmansour R, Benbrahim M, Duvivier D (2021) Mathematical formulations for the parallel machine scheduling problem with a single server. Int J Prod Res 59(20):6166\u20136184","journal-title":"Int J Prod Res"},{"key":"547_CR27","doi-asserted-by":"crossref","unstructured":"Elidrissi A, Benmansour R, Sifaleras A (2022) General variable neighborhood search for the parallel machine scheduling problem with two common servers. Optim Lett 1\u201331","DOI":"10.1007\/s11590-022-01925-2"},{"issue":"2","key":"547_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133","journal-title":"J Glob Optim"},{"issue":"9","key":"547_CR29","doi-asserted-by":"publisher","first-page":"2242","DOI":"10.1016\/j.cor.2011.11.007","volume":"39","author":"HS Gan","year":"2012","unstructured":"Gan HS, Wirth A, Abdekhodaee A (2012) A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. Comput Oper Res 39(9):2242\u20132247","journal-title":"Comput Oper Res"},{"issue":"4","key":"547_CR30","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","volume":"47","author":"CA Glass","year":"2000","unstructured":"Glass CA, Shafransky YM, Strusevich VA (2000) Scheduling for parallel dedicated machines with a single server. Naval Res Logist 47(4):304\u2013328","journal-title":"Naval Res Logist"},{"key":"547_CR31","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Kan AR (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"3","key":"547_CR32","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"NG Hall","year":"2000","unstructured":"Hall NG, Potts CN, Sriskandarajah C (2000) Parallel machine scheduling with a common server. Discrete Appl Math 102(3):223\u2013243","journal-title":"Discrete Appl Math"},{"key":"547_CR33","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.cie.2017.02.013","volume":"106","author":"A Hamzadayi","year":"2017","unstructured":"Hamzadayi A, Yildiz G (2017) Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Comput Ind Eng 106:287\u2013298","journal-title":"Comput Ind Eng"},{"issue":"4","key":"547_CR34","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u0107 N, Moreno Perez JA (2008) Variable neighbourhood search: methods and applications. 4OR 6(4):319\u2013360","journal-title":"4OR"},{"issue":"1","key":"547_CR35","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367\u2013407","journal-title":"Ann Oper Res"},{"issue":"3","key":"547_CR36","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen P, Mladenovi\u0107 N, Todosijevi\u0107 R, Hanafi S (2017) Variable neighborhood search: basics and variants. EURO J Comput Optim 5(3):423\u2013454","journal-title":"EURO J Comput Optim"},{"issue":"1","key":"547_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0167-6377(02)00177-3","volume":"31","author":"M Haouari","year":"2003","unstructured":"Haouari M, Gharbi A (2003) An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines. Oper Res Lett 31(1):49\u201352","journal-title":"Oper Res Lett"},{"key":"547_CR38","doi-asserted-by":"crossref","unstructured":"Hasani K, Kravchenko SA, Werner F (2014a) Block models for scheduling jobs on two parallel machines with a single server. Comput Oper Res 41:94\u201397","DOI":"10.1016\/j.cor.2013.08.015"},{"key":"547_CR39","doi-asserted-by":"crossref","unstructured":"Hasani K, Kravchenko SA, Werner F (2014b) Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server. Int J Prod Res 52(13):3778\u20133792","DOI":"10.1080\/00207543.2013.874607"},{"issue":"1","key":"547_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/0305215X.2015.1005083","volume":"48","author":"K Hasani","year":"2016","unstructured":"Hasani K, Kravchenko SA, Werner F (2016) Minimizing the makespan for the two-machine scheduling problem with a single server: two algorithms for very large instances. Eng Optim 48(1):173\u2013183","journal-title":"Eng Optim"},{"key":"547_CR41","doi-asserted-by":"publisher","first-page":"108586","DOI":"10.1016\/j.cie.2022.108586","volume":"172","author":"V Heinz","year":"2022","unstructured":"Heinz V, Nov\u00e1k A, Vlk M, Hanz\u00e1lek Z (2022) Constraint programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers. Comput Ind Eng 172:108586","journal-title":"Comput Ind Eng"},{"issue":"6","key":"547_CR42","first-page":"3527","volume":"9","author":"PY Hsu","year":"2020","unstructured":"Hsu PY, Lo SH, Hwang HG, Lin BM (2020) Scheduling of anaesthesia operations in operating rooms. Healthcare 9(6):3527\u20133533","journal-title":"Healthcare"},{"issue":"1","key":"547_CR43","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cie.2009.10.003","volume":"58","author":"S Huang","year":"2010","unstructured":"Huang S, Cai L, Zhang X (2010) Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server. Comput Ind Eng 58(1):165\u2013174","journal-title":"Comput Ind Eng"},{"issue":"2","key":"547_CR44","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.cie.2013.07.020","volume":"66","author":"Y Jiang","year":"2013","unstructured":"Jiang Y, Dong J, Ji M (2013) Preemptive scheduling on two parallel machines with a single server. Comput Ind Eng 66(2):514\u2013518","journal-title":"Comput Ind Eng"},{"issue":"11","key":"547_CR45","doi-asserted-by":"publisher","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","volume":"39","author":"MY Kim","year":"2012","unstructured":"Kim MY, Lee YH (2012) MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. Comput Oper Res 39(11):2457\u20132468","journal-title":"Comput Oper Res"},{"key":"547_CR46","doi-asserted-by":"publisher","first-page":"108586","DOI":"10.1016\/j.cor.2020.105115","volume":"126","author":"HJ Kim","year":"2021","unstructured":"Kim HJ, Lee JH (2021) Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers. Comput Oper Res 126:108586","journal-title":"Comput Oper Res"},{"issue":"3","key":"547_CR47","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/s00170-002-1472-2","volume":"22","author":"CO Kim","year":"2003","unstructured":"Kim CO, Shin HJ (2003) Scheduling jobs on parallel machines: a restricted Tabu search approach. Int J Adv Manuf Technol 22(3):278\u2013287","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"547_CR48","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","volume":"23","author":"CP Koulamas","year":"1996","unstructured":"Koulamas CP (1996) Scheduling two parallel semiautomatic machines to minimize machine interference. Comput Oper Res 23(10):945\u2013956","journal-title":"Comput Oper Res"},{"issue":"12","key":"547_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","volume":"26","author":"SA Kravchenko","year":"1997","unstructured":"Kravchenko SA, Werner F (1997) Parallel machine scheduling problems with a single server. Math Comput Model 26(12):1\u201311","journal-title":"Math Comput Model"},{"issue":"98","key":"547_CR50","first-page":"1","volume":"30","author":"SA Kravchenko","year":"1998","unstructured":"Kravchenko SA, Werner F (1998) Scheduling on parallel machines with a single and multiple servers. Otto-von-Guericke-Universitat Magdeburg 30(98):1\u201318","journal-title":"Otto-von-Guericke-Universitat Magdeburg"},{"issue":"1","key":"547_CR51","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10589-019-00142-5","volume":"75","author":"H Krim","year":"2020","unstructured":"Krim H, Benmansour R, Duvivier D, A\u00eft-Kadi D, Hanafi S (2020) Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. Comput Optim Appl 75(1):291\u2013320","journal-title":"Comput Optim Appl"},{"key":"547_CR52","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1007\/s10696-020-09400-9","volume":"33","author":"JH Lee","year":"2021","unstructured":"Lee JH, Kim HJ (2021) A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators. Flex Serv Manuf J 33:992\u20131026","journal-title":"Flex Serv Manuf J"},{"issue":"5","key":"547_CR53","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s00170-009-2203-8","volume":"47","author":"ZJ Lee","year":"2010","unstructured":"Lee ZJ, Lin SW, Ying KC (2010) Scheduling jobs on dynamic parallel machines with sequence-dependent setup times. Int J Adv Manuf Technol 47(5):773\u2013781","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"547_CR54","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.cor.2010.09.020","volume":"38","author":"SW Lin","year":"2011","unstructured":"Lin SW, Lee ZJ, Ying KC, Lu CC (2011) Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates. Comput Oper Res 38(5):809\u2013815","journal-title":"Comput Oper Res"},{"key":"547_CR55","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1080\/01605682.2018.1500976","volume":"70","author":"GS Liu","year":"2019","unstructured":"Liu GS, Li JJ, Yang HD, Huang GQ (2019) Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server. J Oper Res Soc 70:1554\u20131570","journal-title":"J Oper Res Soc"},{"issue":"11","key":"547_CR56","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 Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"547_CR57","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10288-012-0212-1","volume":"11","author":"N Mladenovi\u0107","year":"2013","unstructured":"Mladenovi\u0107 N, Uro\u0161evi\u0107 D, Hanafi S (2013) Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1):57\u201373","journal-title":"4OR"},{"issue":"2","key":"547_CR58","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18(2):193","journal-title":"Asia-Pac J Oper Res"},{"issue":"11","key":"547_CR59","doi-asserted-by":"publisher","first-page":"3173","DOI":"10.1080\/00207549508904867","volume":"33","author":"IM Ovacik","year":"1995","unstructured":"Ovacik IM, Uzsoy R (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Int J Prod Res 33(11):3173\u20133192","journal-title":"Int J Prod Res"},{"issue":"3","key":"547_CR60","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.ejor.2009.06.018","volume":"202","author":"S Perron","year":"2010","unstructured":"Perron S, Hansen P, Le Digabel S, Mladenovi\u0107 N (2010) Exact and heuristic solutions of the global supply chain problem with transfer pricing. Eur J Oper Res 202(3):864\u2013879","journal-title":"Eur J Oper Res"},{"key":"547_CR61","unstructured":"Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. TU, Fachbereich 3, Berlin"},{"issue":"3","key":"547_CR62","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1002\/net.21656","volume":"67","author":"J Respen","year":"2016","unstructured":"Respen J, Zufferey N, Amaldi E (2016) Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks 67(3):246\u2013261","journal-title":"Networks"},{"issue":"10","key":"547_CR63","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1057\/s41274-016-0136-9","volume":"68","author":"J Respen","year":"2017","unstructured":"Respen J, Zufferey N, Wieser P (2017) Three-level inventory deployment for a luxury watch company facing various perturbations. J Oper Res Soc 68(10):1195\u20131210","journal-title":"J Oper Res Soc"},{"issue":"5","key":"547_CR64","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","journal-title":"Oper Res"},{"issue":"2","key":"547_CR65","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00291-014-0376-5","volume":"37","author":"M Schneider","year":"2015","unstructured":"Schneider M, Stenger A, Hof J (2015) An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectrum 37(2):353\u2013387","journal-title":"OR Spectrum"},{"key":"547_CR66","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0925-5273(95)00086-0","volume":"46","author":"JM Schutten","year":"1996","unstructured":"Schutten JM, Leussink R (1996) Parallel machine scheduling with release dates, due dates and family setup times. Int J Prod Econ 46:119\u2013125","journal-title":"Int J Prod Econ"},{"key":"547_CR67","first-page":"1","volume":"72","author":"JMP Silva","year":"2019","unstructured":"Silva JMP, Teixeira E, Subramanian A (2019) Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times. J Oper Res Soc 72:1\u201315","journal-title":"J Oper Res Soc"},{"key":"547_CR68","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.dam.2018.03.019","volume":"261","author":"S Thevenin","year":"2019","unstructured":"Thevenin S, Zufferey N (2019) Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discrete Appl Math 261:344\u2013353","journal-title":"Discrete Appl Math"},{"issue":"6","key":"547_CR70","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10732-016-9321-x","volume":"22","author":"S Thevenin","year":"2016","unstructured":"Thevenin S, Zufferey N, Widmer M (2016) Order acceptance and scheduling with earliness and tardiness penalties. J Heuristics 22(6):849\u2013890","journal-title":"J Heuristics"},{"issue":"1\u20132","key":"547_CR69","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10479-017-2498-z","volume":"259","author":"S Thevenin","year":"2017","unstructured":"Thevenin S, Zufferey N, Glardon R (2017) Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions. Ann Oper Res 259(1\u20132):437\u2013460","journal-title":"Ann Oper Res"},{"issue":"2","key":"547_CR71","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ejor.2016.01.014","volume":"252","author":"R Todosijevi\u0107","year":"2016","unstructured":"Todosijevi\u0107 R, Benmansour R, Hanafi S, Mladenovi\u0107 N, Artiba A (2016) Nested general variable neighborhood search for the periodic maintenance problem. Eur J Oper Res 252(2):385\u2013396","journal-title":"Eur J Oper Res"},{"issue":"3","key":"547_CR72","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10100-015-0395-6","volume":"24","author":"L Torjai","year":"2016","unstructured":"Torjai L, Kruzslicz F (2016) Mixed integer programming formulations for the biomass truck scheduling problem. Cent Eur J Oper Res 24(3):731\u2013745","journal-title":"Cent Eur J Oper Res"},{"issue":"4","key":"547_CR73","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/j.cie.2010.02.012","volume":"58","author":"Y Unlu","year":"2010","unstructured":"Unlu Y, Mason SJ (2010) Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput Ind Eng 58(4):785\u2013800","journal-title":"Comput Ind Eng"},{"issue":"2","key":"547_CR74","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1057\/palgrave.jors.2601074","volume":"52","author":"G Wang","year":"2001","unstructured":"Wang G, Cheng TE (2001) An approximation algorithm for parallel machine scheduling with a common server. J Oper Res Soc 52(2):234\u2013237","journal-title":"J Oper Res Soc"},{"key":"547_CR75","doi-asserted-by":"publisher","first-page":"107343","DOI":"10.1016\/j.cie.2021.107343","volume":"157","author":"D Xu","year":"2021","unstructured":"Xu D, Li G, Zhang F (2021) Scheduling an automatic IoT manufacturing system with multiple servers. Comput Ind Eng 157:107343","journal-title":"Comput Ind Eng"},{"key":"547_CR76","doi-asserted-by":"publisher","first-page":"112959","DOI":"10.1016\/j.eswa.2019.112959","volume":"141","author":"JC Yepes-Borrero","year":"2020","unstructured":"Yepes-Borrero JC, Villa F, Perea F, Caballero-Villalobos JP (2020) Grasp algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Expert Syst Appl 141:112959","journal-title":"Expert Syst Appl"},{"issue":"4","key":"547_CR77","doi-asserted-by":"publisher","first-page":"2848","DOI":"10.1016\/j.eswa.2009.09.006","volume":"37","author":"KC Ying","year":"2010","unstructured":"Ying KC, Cheng HM (2010) Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Syst Appl 37(4):2848\u20132852","journal-title":"Expert Syst Appl"},{"key":"547_CR78","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2016.05.014","volume":"213","author":"A Zhang","year":"2016","unstructured":"Zhang A, Wang H, Chen Y, Chen G (2016) Scheduling jobs with equal processing times and a single server on parallel identical machines. Discrete Appl Math 213:196\u2013206","journal-title":"Discrete Appl Math"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00547-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00547-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00547-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T07:04:35Z","timestamp":1724483075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00547-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":78,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["547"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00547-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"3 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}