{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:37:25Z","timestamp":1771954645588,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T00:00:00Z","timestamp":1679702400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study a home healthcare routing and scheduling problem, where multiple healthcare service provider teams should visit a given set of patients at their homes. The problem involves assigning each patient to a team and generating the routes of the teams such that each patient is visited once. When patients are prioritized according to the severity of their condition or their service urgency, the problem minimizes the total weighted waiting time of the patients, where the weights represent the triage levels. In this form, the problem generalizes the multiple traveling repairman problem. To obtain optimal solutions for small to moderate-size instances, we propose a level-based integer programming (IP) model on a transformed input network. To solve larger instances, we develop a metaheuristic algorithm that relies on a customized saving procedure and a general variable neighborhood search algorithm. We evaluate the IP model and the metaheuristic on various small-, medium- and large-sized instances coming from the vehicle routing literature. While the IP model finds the optimal solutions to all the small- and medium-sized instances within three hours of run time, the metaheuristic algorithm achieves the optimal solutions to all instances within merely a few seconds. We also provide a case study involving Covid-19 patients in a district of Istanbul and derive insights for the planners by means of several analyses.<\/jats:p>","DOI":"10.1007\/s00291-023-00713-3","type":"journal-article","created":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T17:02:20Z","timestamp":1679763740000},"page":"807-852","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0152-7176","authenticated-orcid":false,"given":"Vahid","family":"Akbari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6106-4903","authenticated-orcid":false,"given":"\u0130hsan","family":"Sadati","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6833-2552","authenticated-orcid":false,"given":"F. Sibel","family":"Salman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2884-0047","authenticated-orcid":false,"given":"Davood","family":"Shiri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"key":"713_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s12532-012-0047-y","volume":"5","author":"H Abeledo","year":"2013","unstructured":"Abeledo H, Fukasawa R, Pessoa A, Uchoa E (2013) The time dependent traveling salesman problem: polyhedra and algorithm. Math Program Comput 5:27\u201355","journal-title":"Math Program Comput"},{"key":"713_CR2","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104793","volume":"113","author":"LR Abreu","year":"2020","unstructured":"Abreu LR, Cunha JO, Prata BA, Framinan JM (2020) A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput Oper Res 113:104793","journal-title":"Comput Oper Res"},{"issue":"1","key":"713_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.ejor.2021.02.038","volume":"295","author":"V Akbari","year":"2021","unstructured":"Akbari V, Shiri D (2021) Weighted online minimum latency problem with edge uncertainty. Eur J Oper Res 295(1):51\u201365","journal-title":"Eur J Oper Res"},{"key":"713_CR4","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.cie.2007.06.002","volume":"53","author":"C Akjiratikarl","year":"2007","unstructured":"Akjiratikarl C, Yenradee P, Drake PR (2007) PSO-based algorithm for home care worker scheduling in the UK. Comput Ind Eng 53:559\u2013583","journal-title":"Comput Ind Eng"},{"key":"713_CR5","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1016\/j.apm.2012.05.026","volume":"37","author":"F Angel-Bello","year":"2013","unstructured":"Angel-Bello F, Alvarez A, Garcia I (2013) Two improved formulations for the minimum latency problem. Appl Math Model 37:2257\u20132266","journal-title":"Appl Math Model"},{"key":"713_CR6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s12351-017-0299-4","volume":"19","author":"F Angel-Bello","year":"2019","unstructured":"Angel-Bello F, Cardona-Valdes Y, Alvarez A (2019) Mixed integer formulations for the multiple minimum latency problem. Oper Res Int J 19:369\u2013398","journal-title":"Oper Res Int J"},{"key":"713_CR7","unstructured":"Augerat P, Naddef D, Belenguer JM, Benavent E, Corberan A, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem"},{"key":"713_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2019.07.012","volume":"111","author":"MG Avci","year":"2019","unstructured":"Avci MG, Avci M (2019) An adaptive large neighborhood search approach for multiple traveling repairman problem with profits. Comput Oper Res 111:367\u2013385","journal-title":"Comput Oper Res"},{"issue":"3","key":"713_CR9","doi-asserted-by":"crossref","first-page":"272","DOI":"10.15625\/1813-9663\/33\/3\/10511","volume":"33","author":"BH Bang","year":"2018","unstructured":"Bang BH (2018) A GRASP+VND algorithm for the multiple traveling repairman problem with distance constraints. J Comput Sci Cybern 33(3):272\u2013288","journal-title":"J Comput Sci Cybern"},{"issue":"3","key":"713_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"key":"713_CR11","doi-asserted-by":"crossref","first-page":"2866","DOI":"10.1016\/j.cor.2005.01.015","volume":"33","author":"S Bertels","year":"2006","unstructured":"Bertels S, Fahle T (2006) A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput Oper Res 33:2866\u20132890","journal-title":"Comput Oper Res"},{"key":"713_CR12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10729-014-9285-z","volume":"18","author":"J Bowers","year":"2015","unstructured":"Bowers J, Cheyne H, Mould G, Page M (2015) Continuity of care in community midwifery. Health Care Manag Sci 18:195\u2013204","journal-title":"Health Care Manag Sci"},{"key":"713_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstrom","year":"2008","unstructured":"Bredstrom D, Ronqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191:19\u201331","journal-title":"Eur J Oper Res"},{"key":"713_CR14","doi-asserted-by":"crossref","unstructured":"Bruni ME, Khodaparasti S, Mart\u00ednez-Salazar I, Nucamendi-Guill\u00e9n S (2022) The multi-depot k-traveling repairman problem. Optim Lett 1\u201329","DOI":"10.1007\/s11590-021-01845-7"},{"key":"713_CR15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.cor.2018.01.016","volume":"93","author":"T Bulh\u00f5es","year":"2018","unstructured":"Bulh\u00f5es T, Sadykov R, Uchoa E (2018) A branch-and-price algorithm for the minimum latency problem. Comput Oper Res 93:66\u201378","journal-title":"Comput Oper Res"},{"key":"713_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.omega.2017.08.012","volume":"80","author":"P Cappanera","year":"2018","unstructured":"Cappanera P, Scutella MG, Nervi F, Galli L (2018) Demand uncertainty in robust home care optimization. Omega 80:95\u2013110","journal-title":"Omega"},{"key":"713_CR17","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ejor.2019.07.009","volume":"289","author":"A Cinar","year":"2021","unstructured":"Cinar A, Salman FS, Bozkaya B (2021) Prioritized single nurse routing and scheduling for home healthcare services. Eur J Oper Res 289:867\u2013878","journal-title":"Eur J Oper Res"},{"key":"713_CR18","first-page":"1","volume":"13\u201314","author":"M Cisse","year":"2017","unstructured":"Cisse M, Yalcindag S, Kergosien Y, Sahin E, Lente C, Matta A (2017) OR problems related to home health care: a review of relevant routing and scheduling problems. Oper Res Health Care 13\u201314:1\u201322","journal-title":"Oper Res Health Care"},{"issue":"4","key":"713_CR19","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"713_CR20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.orhc.2018.01.004","volume":"16","author":"J Decerle","year":"2018","unstructured":"Decerle J, Grunder O, El Hassani AH, Barakat O (2018) A memetic algorithm for a home health care routing and scheduling problem. Oper Res Health Care 16:59\u201371","journal-title":"Oper Res Health Care"},{"issue":"7","key":"713_CR21","doi-asserted-by":"crossref","first-page":"1700","DOI":"10.1016\/j.cor.2013.01.003","volume":"40","author":"T Dewilde","year":"2013","unstructured":"Dewilde T, Cattrysse D, Coene S, Spieksma FCR, Vansteenwegen P (2013) Heuristics for the traveling repairman problem with profits. Comput Oper Res 40(7):1700\u20131707","journal-title":"Comput Oper Res"},{"key":"713_CR22","doi-asserted-by":"crossref","unstructured":"Euchi J, Masmoudi M, Siarry P (2022) Home health care routing and scheduling problems: a literature review. 4OR 1\u201339","DOI":"10.1007\/s10288-022-00516-2"},{"key":"713_CR23","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.ejor.2005.01.011","volume":"171","author":"P Eveborn","year":"2006","unstructured":"Eveborn P, Flisberg P, Ronqvist M (2006) LAPS care-an operational system for staff planning of home care. Eur J Oper Res 171:962\u2013976","journal-title":"Eur J Oper Res"},{"key":"713_CR24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.cor.2016.07.019","volume":"77","author":"C Fikar","year":"2017","unstructured":"Fikar C, Hirsch P (2017) Home health care routing and scheduling: a review. Comput Oper Res 77:86\u201395","journal-title":"Comput Oper Res"},{"issue":"1","key":"713_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.10031","volume":"40","author":"A Garc\u00eda","year":"2002","unstructured":"Garc\u00eda A, Jodr\u00e1 P, Tejel J (2002) A note on the traveling repairman problem. Networks 40(1):27\u201331","journal-title":"Networks"},{"key":"713_CR26","unstructured":"Gavish B, Graves SC (1978) The travelling salesman problem and related problems"},{"key":"713_CR27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2018.11.025","volume":"275","author":"F Grenouilleau","year":"2019","unstructured":"Grenouilleau F, Legrain A, Lahrichi N, Rousseau L-M (2019) A set partitioning heuristic for the home health care routing and scheduling problem. Eur J Oper Res 275:295\u2013303","journal-title":"Eur J Oper Res"},{"issue":"9","key":"713_CR28","doi-asserted-by":"crossref","first-page":"1960","DOI":"10.1080\/01605682.2020.1750311","volume":"72","author":"L Grieco","year":"2021","unstructured":"Grieco L, Utley M, Crowe S (2021) Operational research applied to decisions in home health care: a systematic literature review. J Oper Res Soc 72(9):1960\u20131991","journal-title":"J Oper Res Soc"},{"issue":"4","key":"713_CR29","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez M, Jos\u00e9 A (2008) Variable neighbourhood search: methods and applications. 4OR 6(4):319\u2013360","journal-title":"4OR"},{"key":"713_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10100-013-0305-8","volume":"23","author":"G Hiermann","year":"2015","unstructured":"Hiermann G, Prandtstetter M, Rendl A, Puchinger J, Raidl GR (2015) Metaheuristics for solving a multimodal home-healthcare scheduling problem. CEJOR 23:89\u2013113","journal-title":"CEJOR"},{"issue":"3","key":"713_CR31","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s11590-018-1376-1","volume":"14","author":"E Lalla-Ruiz","year":"2020","unstructured":"Lalla-Ruiz E, Vo\u00df S (2020) A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem. Optim Lett 14(3):671\u2013691","journal-title":"Optim Lett"},{"key":"713_CR32","volume":"152","author":"Y Li","year":"2021","unstructured":"Li Y, Xiang T, Szeto WY (2021) Home health care routing and scheduling problem with the consideration of outpatient services. Transp Res Part E Logist Transp Rev 152:102420","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"713_CR33","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.ejor.2013.04.044","volume":"230","author":"R Liu","year":"2013","unstructured":"Liu R, Xie X, Augusto V, Rodriguez C (2013) Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur J Oper Res 230:475\u2013486","journal-title":"Eur J Oper Res"},{"key":"713_CR34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tre.2018.05.009","volume":"116","author":"S Liu","year":"2018","unstructured":"Liu S, Qin S, Zhang R (2018) A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Transp Res Part E Logist Transp Rev 116:25\u201341","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"713_CR35","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.engappai.2019.01.014","volume":"80","author":"Y Lu","year":"2019","unstructured":"Lu Y, Benlic U, Wu Q, Peng B (2019) Memetic algorithm for the multiple traveling repairman problem with profits. Eng Appl Artif Intell 80:35\u201347","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"713_CR36","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ejor.2013.09.014","volume":"234","author":"Z Luo","year":"2014","unstructured":"Luo Z, Qin H, Lim A (2014) Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur J Oper Res 234(1):49\u201360","journal-title":"Eur J Oper Res"},{"key":"713_CR37","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1016\/j.ifacol.2016.07.670","volume":"49","author":"D Manerba","year":"2016","unstructured":"Manerba D, Mansini R (2016) The nurse routing problem with workload constraints and incompatible services. IFAC-PapersOnLine 49:1192\u20131197","journal-title":"IFAC-PapersOnLine"},{"key":"713_CR38","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska DS, Meisel F, Bierwirth C (2014) The home health care routing and scheduling problem with interdependent services. Health Care Manag Sci 17:15\u201330","journal-title":"Health Care Manag Sci"},{"key":"713_CR39","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1016\/j.dam.2008.05.009","volume":"156","author":"I Mendez-Diaz","year":"2008","unstructured":"Mendez-Diaz I, Zabala P, Lucena A (2008) A new formulation for the traveling deliveryman problem. Discret Appl Math 156:3223\u20133237","journal-title":"Discret Appl Math"},{"issue":"1","key":"713_CR40","doi-asserted-by":"crossref","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":"1","key":"713_CR41","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1287\/trsc.2020.1005","volume":"55","author":"AE Muritiba","year":"2021","unstructured":"Muritiba AE, Fernandes B, Tib\u00e9rius O, Silva D, Oliveira S, Iori M (2021) Branch-and-cut and iterated local search for the weighted k-traveling repairman problem: an application to the maintenance of speed cameras. Transp Sci 55(1):139\u2013159","journal-title":"Transp Sci"},{"key":"713_CR42","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10729-019-09469-1","volume":"23","author":"JA Nasir","year":"2020","unstructured":"Nasir JA, Dang C (2020) Quantitative thresholds based decision support approach for the home health care scheduling and routing problem. Health Care Manag Sci 23:215\u2013238","journal-title":"Health Care Manag Sci"},{"issue":"6","key":"713_CR43","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1134\/S1064230715040024","volume":"54","author":"S Nucamendi","year":"2015","unstructured":"Nucamendi S, Cardona-Valdes Y, Angel-Bello Acosta F (2015) Minimizing customers\u2019 waiting time in a vehicle routing problem with unit demands. J Comput Syst Sci Int 54(6):866\u2013881","journal-title":"J Comput Syst Sci Int"},{"issue":"8","key":"713_CR44","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1057\/jors.2015.113","volume":"67","author":"S Nucamendi-Guill\u00e9n","year":"2016","unstructured":"Nucamendi-Guill\u00e9n S, Mart\u00ednez-Salazar I, Angel-Bello F, Moreno-Vega JM (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-Travelling Repairmen Problem. J Oper Res Soc 67(8):1121\u20131134","journal-title":"J Oper Res Soc"},{"issue":"1","key":"713_CR45","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.ejor.2020.09.022","volume":"291","author":"B Pan","year":"2021","unstructured":"Pan B, Zhang Z, Lim A (2021) Multi-trip time-dependent vehicle routing problem with time windows. Eur J Oper Res 291(1):218\u2013231","journal-title":"Eur J Oper Res"},{"issue":"1","key":"713_CR46","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"J-C Picard","year":"1978","unstructured":"Picard J-C, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86\u2013110","journal-title":"Oper Res"},{"key":"713_CR47","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","volume":"219","author":"MS Rasmussen","year":"2012","unstructured":"Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. Eur J Oper Res 219:598\u2013610","journal-title":"Eur J Oper Res"},{"key":"713_CR48","doi-asserted-by":"crossref","unstructured":"Sadati MEH, Akbari V, \u00c7atay B (2022) Electric vehicle routing problem with flexible deliveries. Int J Prod Res 1\u201327","DOI":"10.1080\/00207543.2022.2032451"},{"issue":"2","key":"713_CR49","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10288-011-0153-0","volume":"9","author":"A Salehipour","year":"2011","unstructured":"Salehipour A, S\u00f6rensen K, Goos P, Br\u00e4ysy O (2011) Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2):189\u2013209","journal-title":"4OR"},{"key":"713_CR50","unstructured":"Sarubbi J, Luna H, Miranda G (2008) Minimum latency problem as a shortest path problem with side constraints. In: XIV Latin Ibero-American congress on operations research (CLAIO)"},{"key":"713_CR51","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.trb.2017.04.003","volume":"101","author":"JF Sze","year":"2017","unstructured":"Sze JF, Salhi S, Wassan N (2017) The cumulative capacitated vehicle routing problem with min-sum and min\u2013max objectives: an effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search. Transp Res Part B Methodol 101:162\u2013184","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"713_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.10.048","volume":"301","author":"D Tippong","year":"2022","unstructured":"Tippong D, Petrovic S, Akbari V (2022) A review of applications of operational research in healthcare coordination in disaster management. Eur J Oper Res 301(1):1\u201317","journal-title":"Eur J Oper Res"},{"key":"713_CR53","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1007\/s00291-011-0253-4","volume":"33","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser A, Gronalt M, Hirsch P (2011) Securing home health care in times of natural disasters. OR Spectrum 33:787\u2013813","journal-title":"OR Spectrum"},{"key":"713_CR54","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cor.2019.07.016","volume":"111","author":"E Vallada","year":"2019","unstructured":"Vallada E, Villa F, Fanjul-Peyro L (2019) Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem. Comput Oper Res 111:415\u2013424","journal-title":"Comput Oper Res"},{"issue":"5","key":"713_CR55","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0190(00)00102-2","volume":"75","author":"BY Wu","year":"2000","unstructured":"Wu BY (2000) Polynomial time algorithms for some minimum latency problems. Inf Process Lett 75(5):225\u2013229","journal-title":"Inf Process Lett"},{"key":"713_CR56","volume":"169","author":"K-C Ying","year":"2022","unstructured":"Ying K-C, Lin S-W (2022) Minimizing total completion time in the no-wait jobshop scheduling problem using a backtracking metaheuristic. Comput Ind Eng 169:108238","journal-title":"Comput Ind Eng"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00713-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-023-00713-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00713-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T11:02:30Z","timestamp":1690801350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-023-00713-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,25]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["713"],"URL":"https:\/\/doi.org\/10.1007\/s00291-023-00713-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,25]]},"assertion":[{"value":"2 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}