{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T23:29:16Z","timestamp":1759879756150,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:00:00Z","timestamp":1616112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T00:00:00Z","timestamp":1616112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00291-021-00622-3","type":"journal-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T09:59:46Z","timestamp":1616147986000},"page":"543-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A network flow-based algorithm for bus driver rerostering"],"prefix":"10.1007","volume":"43","author":[{"given":"Ana","family":"Paias","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3546-3932","authenticated-orcid":false,"given":"Marta","family":"Mesquita","sequence":"additional","affiliation":[]},{"given":"Margarida","family":"Moz","sequence":"additional","affiliation":[]},{"given":"Margarida","family":"Pato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,19]]},"reference":[{"key":"622_CR1","unstructured":"Carris, Relat\u00f3rio e Contas 2017 (2018) http:\/\/www.carris.pt\/fotos\/pageflip\/rel_contas2017\/CARRIS%20Relatorio%20e%20Contas%20FINAL.pdf. Accessed 29th Nov 2019"},{"key":"622_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1109\/TSMC.2016.2560130","volume":"47","author":"C-H Chen","year":"2017","unstructured":"Chen C-H, Chou J-H (2017) Multiobjective optimization of airline crew roster recovery problems under disruption conditions. IEEE Trans Syst Man Cybern 47:133\u2013144","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"622_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/trsc.1080.0257","volume":"43","author":"C Gao","year":"2009","unstructured":"Gao C, Johnson E, Smith B (2009) Integrated airline fleet and crew robust planning. Transp Sci 43:2\u201316","journal-title":"Transp Sci"},{"key":"622_CR4","unstructured":"IBM ILOG CPLEX optimization studio V12.8.0. (2017) IBM Corporation, New York"},{"key":"622_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.cor.2015.03.010","volume":"61","author":"J Ingels","year":"2015","unstructured":"Ingels J, Maenhout B (2015) The impact of reserved duties on the robustness of a personnel shift roster: an empirical investigation. Comput Oper Res 61:153\u2013169","journal-title":"Comput Oper Res"},{"key":"622_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00291-017-0476-0","volume":"39","author":"J Ingels","year":"2017","unstructured":"Ingels J, Maenhout B (2017) Employee substitutability as a tool to improve the robustness in personnel scheduling. OR Spectr 39:623\u2013658","journal-title":"OR Spectr"},{"key":"622_CR7","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.omega.2012.10.010","volume":"41","author":"B Maenhout","year":"2013","unstructured":"Maenhout B, Vanhoucke M (2013) Reconstructing nurse schedules: computational insights in the problem size parameters. Omega 41:903\u2013918","journal-title":"Omega"},{"key":"622_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10951-010-0195-8","volume":"14","author":"M Mesquita","year":"2011","unstructured":"Mesquita M, Moz M, Paias A, Paix\u00e3o J, Pato M, Resp\u00edcio A (2011) A new model for the integrated vehicle-crew-rostering problem and a new computational study on rosters. J Sched 14:319\u2013334","journal-title":"J Sched"},{"key":"622_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2015.03.030","volume":"245","author":"M Mesquita","year":"2015","unstructured":"Mesquita M, Moz M, Paias A, Pato M (2015) A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days off pattern. Eur J Oper Res 245:423\u2013437","journal-title":"Eur J Oper Res"},{"key":"622_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022907212477","volume":"119","author":"M Moz","year":"2003","unstructured":"Moz M, Pato M (2003) An integer multicommodity flow model applied to the rerostering of nurse schedules. Ann Oper Res 119:285\u2013301","journal-title":"Ann Oper Res"},{"issue":"4","key":"622_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1287\/trsc.1100.0322","volume":"44","author":"D Potthoff","year":"2010","unstructured":"Potthoff D, Huisman D, Desaulniers G (2010) Column generation with dynamic duty selection for railway crew rescheduling. Transp Sci 44(4):493\u2013505","journal-title":"Transp Sci"},{"key":"622_CR12","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.cor.2009.03.023","volume":"37","author":"NJ Rezanova","year":"2010","unstructured":"Rezanova NJ, Ryan DM (2010) The train driver recovery problem\u2014a set partitioning based model and solution method. Comput Oper Res 37:845\u2013856","journal-title":"Comput Oper Res"},{"key":"622_CR13","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s00291-017-0485-z","volume":"39","author":"FZ Sargut","year":"2017","unstructured":"Sargut FZ, Altunta\u015f C, Tulazo\u011flu DC (2017) Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation. OR Spectr 39:1071\u20131096","journal-title":"OR Spectr"},{"key":"622_CR14","first-page":"68","volume":"1","author":"A Shibghatullah","year":"2017","unstructured":"Shibghatullah A, Safei S, Abal Abas Z, Zainal Abidin Z, Musa H, Rahmalan H (2017) Automated bus crew rescheduling for late sign-on (LSFO) event using multi-agent system. Int J Hum Technol Interact 1:68\u201372","journal-title":"Int J Hum Technol Interact"},{"key":"622_CR15","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/mnsc.22.9.972","volume":"22","author":"VM Trivedi","year":"1976","unstructured":"Trivedi VM, Warner DM (1976) A branch and bound algorithm for optimum allocation of float nurses. Manag Sci 22:972\u2013981","journal-title":"Manag Sci"},{"key":"622_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.trc.2010.09.008","volume":"20","author":"L Veelenturf","year":"2012","unstructured":"Veelenturf L, Potthoff D, Huisman D, Kroon L (2012) Railway crew rescheduling with retiming. Transp Res Part C 20:95\u2013110","journal-title":"Transp Res Part C"},{"key":"622_CR17","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1287\/trsc.2014.0545","volume":"50","author":"L Veelenturf","year":"2016","unstructured":"Veelenturf L, Potthoff D, Huisman D, Kroon L, Mar\u00f3ti G, Wagelmans A (2016) A quasi-robust optimization approach for resource rescheduling. Transp Sci 50:204\u2013215","journal-title":"Transp Sci"},{"key":"622_CR18","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.cor.2009.03.024","volume":"37","author":"O Weide","year":"2010","unstructured":"Weide O, Ryan D, Ehrgott M (2010) An iterative approach to robust and integrated aircraft routing and crew scheduling. Comput Oper Res 37:833\u2013844","journal-title":"Comput Oper Res"},{"key":"622_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00291-014-0364-9","volume":"37","author":"L Xie","year":"2015","unstructured":"Xie L, Suhl L (2015) Cyclic and non-cyclic crew rostering problems in public bus transit. OR Spectr 37:99\u2013136","journal-title":"OR Spectr"},{"key":"622_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10732-017-9348-7","volume":"23","author":"L Xie","year":"2017","unstructured":"Xie L, Merschformann M, Kliewer N, Suhl L (2017) Metaheuristics approach for solving personalized crew rostering problem in public bus transit. J Heuristics 23:321\u2013347","journal-title":"J Heuristics"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00622-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T02:08:50Z","timestamp":1622686130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00622-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,19]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00622-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2021,3,19]]},"assertion":[{"value":"28 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}