{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:12:45Z","timestamp":1776334365773,"version":"3.51.2"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006389","name":"University of Geneva","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006389","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>At the scale of Switzerland, the national railway company <jats:italic>SBB Cargo AG<\/jats:italic> has to schedule its locomotives and drivers in order to be able to pull all trains. Two objective functions are considered in a two-stage lexicographic fashion: (1) the locomotive and driver costs and (2) the driver time that is spent without driving. As the problem instances tend to reach really big sizes (up to 1900 trains), we propose to schedule locomotives and drivers in a sequential way, thus having a sequence of smaller problems to solve. Moreover, for smaller instances, we also propose to schedule jointly locomotives and drivers in an integrated way, therefore increasing the search space but possibly leading to better solutions. In this paper, we present a mathematical formulation and model for the problem. We also consider the contract-related constraints of the drivers, and we propose a way to integrate some time flexibility in the schedules. Next, we propose an innovative matheuristic to solve the problem, relying on a descent local search and a rolling horizon decomposition. An important goal of this method is to explore thoroughly at which extent a general-purpose solver can be used on this problem. Finally, the benefits of each aspect of the model and of the method are analyzed in detail on the results obtained for 20 real <jats:italic>SBB Cargo AG<\/jats:italic> instances.<\/jats:p>","DOI":"10.1007\/s00291-023-00729-9","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T08:02:01Z","timestamp":1689321721000},"page":"1113-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A matheuristic for tactical locomotive and driver scheduling for the Swiss national railway company SBB Cargo AG"],"prefix":"10.1007","volume":"45","author":[{"given":"Marie-Sklaerder","family":"Vi\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4361-5510","authenticated-orcid":false,"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Minner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,14]]},"reference":[{"issue":"5","key":"729_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/inte.1050.0158","volume":"35","author":"E Abbink","year":"2005","unstructured":"Abbink E, Fischetti M, Kroon L, Timmer G, Vromans M (2005) Reinventing crew scheduling at Netherlands Railways. Interfaces 35(5):393\u2013401","journal-title":"Interfaces"},{"issue":"4","key":"729_CR2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1050.0115","volume":"39","author":"R Ahuja","year":"2005","unstructured":"Ahuja R, Liu J, Orlin J, Sharma D, Shughart L (2005) Solving real-life locomotive-scheduling problems. Transp Sci 39(4):503\u2013517","journal-title":"Transp Sci"},{"issue":"4","key":"729_CR3","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1007\/s00291-009-0182-7","volume":"33","author":"H Amrani","year":"2011","unstructured":"Amrani H, Martel A, Zufferey N, Makeeva P (2011) A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations. Oper Res Spectr 33(4):989\u20131007","journal-title":"Oper Res Spectr"},{"issue":"4","key":"729_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti C, Speranza M (2014) A survey on matheuristics for routing problems. EURO J Comput Optim 2(4):223\u2013246","journal-title":"EURO J Comput Optim"},{"key":"729_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01300969","volume":"3","author":"DA Babayev","year":"1994","unstructured":"Babayev DA, Mardanov SS (1994) Reducing the number of variables in integer and linear programming problems. Comput Optim Appl 3:99\u2013109","journal-title":"Comput Optim Appl"},{"issue":"1","key":"729_CR6","first-page":"21","volume":"16","author":"M Ball","year":"2011","unstructured":"Ball M (2011) Heuristics based on mathematical programming. Surv Oper Res Manag Sci 16(1):21\u201338","journal-title":"Surv Oper Res Manag Sci"},{"issue":"3","key":"729_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230170303","volume":"17","author":"A Bertossi","year":"1987","unstructured":"Bertossi A, Carraresi P, Gallo G (1987) On some matching problems arising in vehicle scheduling models. Networks 17(3):271\u2013281","journal-title":"Networks"},{"key":"729_CR8","volume-title":"Optimization over integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas D, Weismantel R (2005) Optimization over integers. Dynamic Ideas, Belmont, Massachusetts"},{"key":"729_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-73312-6_1","volume-title":"Computer-aided systems in public transport","author":"R Bornd\u00f6rfer","year":"2008","unstructured":"Bornd\u00f6rfer R, L\u00f6bel A, Weider S (2008) A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. In: Hickman M, Mirchandani P, Voss S (eds) Computer-aided systems in public transport, vol 600. Springer, Berlin, Heidelberg, pp 3\u201324"},{"issue":"1\u20134","key":"729_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/B:ANOR.0000019089.86834.91","volume":"127","author":"M Boschetti","year":"2004","unstructured":"Boschetti M, Mingozzi A, Ricciardelli S (2004) An exact algorithm for the simplified multiple depot crew scheduling problem. Ann Oper Res 127(1\u20134):177\u2013201","journal-title":"Ann Oper Res"},{"issue":"2","key":"729_CR11","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.2014.0536","volume":"50","author":"B Bouzaiene-Ayari","year":"2014","unstructured":"Bouzaiene-Ayari B, Cheng C, Das S, Fiorillo R, Powell WB (2014) From single commodity to multiattribute models for locomotive optimization: a comparison of optimal integer programming and approximate dynamic programming. Transp Sci 50(2):366\u2013389","journal-title":"Transp Sci"},{"key":"729_CR12","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00291-008-0143-6","volume":"32","author":"RL Burdett","year":"2010","unstructured":"Burdett RL, Kozan E (2010) A sequencing approach for creating new train timetables. OR Spectr 32:163\u2013193","journal-title":"OR Spectr"},{"key":"729_CR13","first-page":"129","volume-title":"Handbooks in operations research and management science: transportation","author":"A Caprara","year":"2006","unstructured":"Caprara A, Kroon L, Monaci M, Peeters M, Toth P (2006) Passenger railway optimization. Handbooks in operations research and management science: transportation. Elsevier, Amsterdam, pp 129\u2013188"},{"key":"729_CR14","doi-asserted-by":"crossref","first-page":"102394","DOI":"10.1016\/j.omega.2021.102394","volume":"103","author":"LE Cardenas-Barron","year":"2021","unstructured":"Cardenas-Barron LE, Melo RA (2021) A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. Omega 103:102394","journal-title":"Omega"},{"key":"729_CR15","doi-asserted-by":"crossref","first-page":"104762","DOI":"10.1016\/j.cor.2019.104762","volume":"112","author":"MA Coindreau","year":"2019","unstructured":"Coindreau MA, Gallay O, Zufferey N, Laporte G (2019) Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer. Comput Oper Res 112:104762","journal-title":"Comput Oper Res"},{"issue":"3","key":"729_CR16","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/j.ejor.2021.02.031","volume":"294","author":"MA Coindreau","year":"2021","unstructured":"Coindreau MA, Gallay O, Zufferey N, Laporte G (2021) Inbound and outbound flow integration for cross-docking operations. Euro J Oper Res 294(3):1153\u20131163","journal-title":"Euro J Oper Res"},{"issue":"2","key":"729_CR17","first-page":"136","volume":"25","author":"T Crainic","year":"1987","unstructured":"Crainic T, Rousseau JM (1987) The column generation principle and the airline crew scheduling problem. INFOR Inf Syst Oper Res 25(2):136\u2013151","journal-title":"INFOR Inf Syst Oper Res"},{"issue":"4","key":"729_CR18","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10732-010-9141-3","volume":"17","author":"R De Leone","year":"2011","unstructured":"De Leone R, Festa P, Marchitto E (2011) A bus driver scheduling problem: a new mathematical model and a GRASP approximate solution. J Heuristics 17(4):441\u2013466","journal-title":"J Heuristics"},{"issue":"10","key":"729_CR19","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1057\/palgrave.jors.2601271","volume":"53","author":"S Fores","year":"2002","unstructured":"Fores S, Proll L, Wren A (2002) TRACS II: a hybrid IP\/heuristic driver scheduling system for public transport. J Oper Res Soc 53(10):1093\u20131100","journal-title":"J Oper Res Soc"},{"issue":"1","key":"729_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1022287504028","volume":"6","author":"R Freling","year":"2003","unstructured":"Freling R, Huisman D, Wagelmans A (2003) Models and algorithms for integration of vehicle and crew scheduling. J Sched 6(1):63\u201385","journal-title":"J Sched"},{"key":"729_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-642-85970-0_4","volume-title":"Comput Aided Transit Schedul","author":"C Friberg","year":"1999","unstructured":"Friberg C, Haase K (1999) An exact branch and cut algorithm for the vehicle and crew scheduling problem. Comput Aided Transit Schedul. Springer, Berlin, Heidelberg, pp 63\u201380"},{"key":"729_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-3-030-18500-8_14","volume-title":"Operations research proceedings 2018","author":"S Frisch","year":"2019","unstructured":"Frisch S, Hungerl\u00e4nder P, Jellen A, Weinberger D (2019) a mixed integer linear program for optimizing the utilization of locomotives with maintenance constraints. In: Fortz B, Labb\u00e9 M (eds) Operations research proceedings 2018. Springer International Publishing, Cham, pp 103\u2013109"},{"key":"729_CR23","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.trb.2021.06.017","volume":"150","author":"S Frisch","year":"2021","unstructured":"Frisch S, Hungerl\u00e4nder P, Jellen A, Primas B, Steininger S, Weinberger D (2021) Solving a real-world locomotive scheduling problem with maintenance constraints. Transp Res Part B Methodol 150:386\u2013409","journal-title":"Transp Res Part B Methodol"},{"key":"729_CR24","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.dam.2016.05.030","volume":"228","author":"D Gaur","year":"2017","unstructured":"Gaur D, Singh R (2017) A heuristic for cumulative vehicle routing using column generation. Discret Appl Math 228:140\u2013157","journal-title":"Discret Appl Math"},{"key":"729_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s12469-022-00292-6","author":"L Ge","year":"2022","unstructured":"Ge L, Kliewer N, Nourmohammadzadeh A, Voss S, Xie L (2022) Revisiting the richness of integrated vehicle and crew scheduling. Public Transp. https:\/\/doi.org\/10.1007\/s12469-022-00292-6","journal-title":"Public Transp"},{"key":"729_CR26","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tre.2016.03.019","volume":"91","author":"JT Haahr","year":"2016","unstructured":"Haahr JT, Wagenaar JC, Veelenturf LP, Kroon LG (2016) A comparison of two exact methods for passenger railway rolling stock (re)scheduling. Transp Res Part E Logist Transp Rev 91:15\u201332","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3","key":"729_CR27","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","volume":"35","author":"K Haase","year":"2001","unstructured":"Haase K, Desaulniers G, Desrosiers J (2001) Simultaneous vehicle and crew scheduling in urban mass transit systems. Transp Sci 35(3):286\u2013303","journal-title":"Transp Sci"},{"key":"729_CR28","doi-asserted-by":"crossref","first-page":"105904","DOI":"10.1016\/j.cor.2022.105904","volume":"146","author":"JR Hansen","year":"2022","unstructured":"Hansen JR, Fagerholt K, Meisel F (2022) A MIP-based heuristic for a single trade routing and scheduling problem in roll-on roll-off shipping. Comput Oper Res 146:105904","journal-title":"Comput Oper Res"},{"issue":"2","key":"729_CR29","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2019.06.016","volume":"283","author":"J Heil","year":"2020","unstructured":"Heil J, Hoffmann K, Buscher U (2020) Railway crew scheduling: models, methods and applications. Eur J Oper Res 283(2):405\u2013425","journal-title":"Eur J Oper Res"},{"issue":"2","key":"729_CR30","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10288-004-0057-3","volume":"3","author":"A Hertz","year":"2005","unstructured":"Hertz A, Schindl D, Zufferey N (2005) Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2):139\u2013161","journal-title":"4OR"},{"issue":"1","key":"729_CR31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10100-017-0489-4","volume":"27","author":"M Horv\u00e1th","year":"2019","unstructured":"Horv\u00e1th M, Kis T (2019) Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. CEJOR 27(1):39\u201367","journal-title":"CEJOR"},{"issue":"4","key":"729_CR32","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1287\/trsc.1040.0104","volume":"39","author":"D Huisman","year":"2005","unstructured":"Huisman D, Freling R, Wagelmans A (2005) Multiple-depot integrated vehicle and crew scheduling. Transp Sci 39(4):491\u2013502","journal-title":"Transp Sci"},{"key":"729_CR33","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00291-014-0381-8","volume":"37","author":"S J\u00fctte","year":"2015","unstructured":"J\u00fctte S, Thonemann U (2015) A graph partitioning strategy for solving large-scale crew scheduling problems. OR Spectr 37:137\u2013170","journal-title":"OR Spectr"},{"key":"729_CR34","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cor.2014.07.007","volume":"52","author":"M Kchaou Boujelben","year":"2014","unstructured":"Kchaou Boujelben M, Gicquel C, Minoux M (2014) A distribution network design problem in the automotive industry: MIP formulation and heuristics. Comput Oper Res 52:16\u201328","journal-title":"Comput Oper Res"},{"issue":"2","key":"729_CR35","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.ejor.2010.06.002","volume":"207","author":"GM Kopanos","year":"2010","unstructured":"Kopanos GM, Mendez CA, Puigjaner L (2010) MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry. Eur J Oper Res 207(2):644\u2013655","journal-title":"Eur J Oper Res"},{"key":"729_CR36","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10951-010-0212-y","volume":"14","author":"R Kwan","year":"2011","unstructured":"Kwan R (2011) Case studies of successful train crew scheduling optimisation. J Sched 14:423\u2013434","journal-title":"J Sched"},{"issue":"2","key":"729_CR37","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.2019.0907","volume":"54","author":"E Lam","year":"2020","unstructured":"Lam E, Van Hentenryck P, Kilby P (2020) Joint vehicle and crew routing and scheduling. Transp Sci 54(2):488\u2013511","journal-title":"Transp Sci"},{"key":"729_CR38","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.dam.2016.03.019","volume":"234","author":"V Leggieri","year":"2018","unstructured":"Leggieri V, Haouari M (2018) A matheuristic for the asymmetric capacitated vehicle routing problem. Discret Appl Math 234:139\u2013150","journal-title":"Discret Appl Math"},{"issue":"1","key":"729_CR39","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ejor.2019.09.010","volume":"282","author":"F Lehu\u00e9d\u00e9","year":"2020","unstructured":"Lehu\u00e9d\u00e9 F, P\u00e9ton O, Tricoire F (2020) A lexicographic minimax approach to the vehicle routing problem with route balancing. Eur J Oper Res 282(1):129\u2013147","journal-title":"Eur J Oper Res"},{"issue":"2","key":"729_CR40","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Kan A (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221\u2013227","journal-title":"Networks"},{"issue":"1","key":"729_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti E, Toth P (2010) A survey on vertex coloring problems. Int Trans Oper Res 17(1):1\u201334","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"729_CR42","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s12469-008-0005-2","volume":"1","author":"M Mesquita","year":"2009","unstructured":"Mesquita M, Paias A, Resp\u00edcio A (2009) Branching approaches for integrated vehicle and crew scheduling. Public Transp 1(1):21\u201337","journal-title":"Public Transp"},{"issue":"1","key":"729_CR43","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1137\/S00361445023685","volume":"45","author":"G Pataki","year":"2003","unstructured":"Pataki G (2003) Teaching integer programming formulations using the traveling salesman problem. SIAM Rev 45(1):116\u2013123","journal-title":"SIAM Rev"},{"key":"729_CR44","doi-asserted-by":"crossref","unstructured":"Perumal S, Dollevoet T, Huisman D, Lusby R, Larsen J, Riis M (2020) Solution approaches for vehicle and crew scheduling with electric buses. Department of Technology, Management and Economics, Technical University of Denmark, Tech. rep","DOI":"10.1016\/j.cor.2021.105268"},{"key":"729_CR45","unstructured":"Perumal S, Lusby R, Larsen J (2020) A review of integrated approaches for optimizing electric vehicle and crew schedules. Department of Technology, Management and Economics, Technical University of Denmark, Tech. rep"},{"key":"729_CR46","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1111\/itor.12062","volume":"21","author":"F Piu","year":"2014","unstructured":"Piu F, Speranza M (2014) The locomotive assignment problem: a survey on optimization models. Int Trans Oper Res 21:327\u2013352","journal-title":"Int Trans Oper Res"},{"key":"729_CR47","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12469-008-0007-0","volume":"1","author":"R Portugal","year":"2009","unstructured":"Portugal R, Co HRL, Paix\u00e3o JP (2009) Driver scheduling problem modelling. Public Transp 1:103\u2013120","journal-title":"Public Transp"},{"issue":"1","key":"729_CR48","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ast.2009.11.003","volume":"14","author":"X Prats","year":"2010","unstructured":"Prats X, Puig V, Quevedo J, Nejjari F (2010) Lexicographic optimisation for optimal departure aircraft trajectories. Aerosp Sci Technol 14(1):26\u201337","journal-title":"Aerosp Sci Technol"},{"key":"729_CR49","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1007\/s00291-020-00592-y","volume":"42","author":"C R\u00e4hlmann","year":"2020","unstructured":"R\u00e4hlmann C, Thonemann U (2020) Railway crew scheduling with semi-flexible timetables. OR Spectr 42:835\u2013862","journal-title":"OR Spectr"},{"issue":"10","key":"729_CR50","doi-asserted-by":"crossref","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"},{"key":"729_CR51","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s00291-019-00560-1","volume":"41","author":"M Sama","year":"2019","unstructured":"Sama M, D\u2019Ariano A, Palagachev K, Gerdts M (2019) Integration methods for aircraft scheduling and trajectory optimization at a busy terminal manoeuvring area. OR Spectr 41:641\u2013681","journal-title":"OR Spectr"},{"key":"729_CR52","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.trb.2020.05.020","volume":"139","author":"M Scheffler","year":"2020","unstructured":"Scheffler M, Neufeld J, H\u00f6lscher M (2020) An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes. Transp Res Part B Methodol 139:64\u201380","journal-title":"Transp Res Part B Methodol"},{"key":"729_CR53","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1057\/palgrave.jors.2601758","volume":"55","author":"EA Silver","year":"2004","unstructured":"Silver EA (2004) An overview of heuristic solution methods. J Oper Res Soc 55:936\u2013956","journal-title":"J Oper Res Soc"},{"issue":"3","key":"729_CR54","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon C, Cung VD, Nguyen A, Artigues C (2008) The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. Eur J Oper Res 191(3):912\u2013927","journal-title":"Eur J Oper Res"},{"key":"729_CR55","doi-asserted-by":"crossref","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. Discret Appl Math 261:344\u2013353","journal-title":"Discret Appl Math"},{"issue":"6","key":"729_CR56","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1080\/00207543.2016.1181285","volume":"55","author":"S Thevenin","year":"2017","unstructured":"Thevenin S, Zufferey N, Potvin JY (2017) Makespan minimization for a parallel machine scheduling problem with preemption and job incompatibility. Int J Prod Res 55(6):1588\u20131606","journal-title":"Int J Prod Res"},{"key":"729_CR57","doi-asserted-by":"crossref","first-page":"107038","DOI":"10.1016\/j.compchemeng.2020.107038","volume":"142","author":"A Toscano","year":"2020","unstructured":"Toscano A, Ferreira D, Morabito R (2020) Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings. Comput Chem Eng 142:107038","journal-title":"Comput Chem Eng"},{"key":"729_CR58","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.trb.2007.06.003","volume":"42","author":"B Vaidyanathan","year":"2008","unstructured":"Vaidyanathan B, Ahuja R, Liu J, Shughart L (2008a) Real-life locomotive planning: new formulations and computational results. Transp Res Part B Methodol 42:147\u2013168","journal-title":"Transp Res Part B Methodol"},{"issue":"4","key":"729_CR59","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/trsc.1080.0244","volume":"42","author":"B Vaidyanathan","year":"2008","unstructured":"Vaidyanathan B, Ahuja R, Orlin J (2008b) The locomotive routing problem. Sci Transp 42(4):492\u2013507","journal-title":"Sci Transp"},{"issue":"2","key":"729_CR60","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.ejor.2018.06.047","volume":"272","author":"MS Vi\u00e9","year":"2019","unstructured":"Vi\u00e9 MS, Zufferey N, Cordeau JF (2019) Solving the wire-harness design problem at a European car manufacturer. Eur J Oper Res 272(2):712\u2013724","journal-title":"Eur J Oper Res"},{"key":"729_CR61","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s10951-022-00730-0","volume":"25","author":"MS Vi\u00e9","year":"2022","unstructured":"Vi\u00e9 MS, Zufferey N, Leus R (2022) Aircraft landing planning under uncertainties. J Sched 25:203\u2013208","journal-title":"J Sched"},{"key":"729_CR62","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.endm.2008.01.051","volume":"30","author":"A Weintraub","year":"2008","unstructured":"Weintraub A, Pereira M, Schultz X (2008) A priori and a posteriori aggregation procedures to reduce model size in MIP mine planning models. Electr Notes Discret Math 30:297\u2013302","journal-title":"Electr Notes Discret Math"},{"key":"729_CR63","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/A:1024854522373","volume":"6","author":"A Wren","year":"2003","unstructured":"Wren A, Fores S, Kwan AKR, Parker M, Proll L (2003) A flexible system for scheduling drivers. J Sched 6:437\u2013455","journal-title":"J Sched"},{"issue":"2","key":"729_CR64","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/trsc.1030.0078","volume":"39","author":"T Yunes","year":"2005","unstructured":"Yunes T, Moura A, De Souza C (2005) Hybrid column generation approaches for urban transit crew management problems. Transp Sci 39(2):273\u2013288","journal-title":"Transp Sci"},{"key":"729_CR65","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.trb.2021.11.009","volume":"155","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Peng Q, Lu G, Zhong Q, Yan X, Zhou X (2022) Integrated line planning and train timetabling through price-basedcross-resolution feedback mechanism. Transp Res Part B Methodol 155:240\u2013277","journal-title":"Transp Res Part B Methodol"},{"key":"729_CR66","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.trb.2019.05.013","volume":"126","author":"Q Zhong","year":"2019","unstructured":"Zhong Q, Lusby RM, Larsen J, Zhang Y, Peng Q (2019) Rolling stock scheduling with maintenance requirements at the Chinese high-speed railway. Transp Res Part B Methodol 126:24\u201344","journal-title":"Transp Res Part B Methodol"},{"issue":"2","key":"729_CR67","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1287\/opre.2013.1254","volume":"62","author":"E Zhu","year":"2014","unstructured":"Zhu E, Crainic TG, Gendreau M (2014) Scheduled service network design for freight rail transportation. Oper Res 62(2):383\u2013400","journal-title":"Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00729-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-023-00729-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-023-00729-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T11:03:57Z","timestamp":1699959837000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-023-00729-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["729"],"URL":"https:\/\/doi.org\/10.1007\/s00291-023-00729-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,14]]},"assertion":[{"value":"14 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2023","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"}}]}}