{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T11:24:21Z","timestamp":1773660261496,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":["J Sched"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10951-025-00860-1","type":"journal-article","created":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T09:14:29Z","timestamp":1765185269000},"page":"83-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A study of different preemption types to facilitate the recovery of personnel task schedules"],"prefix":"10.1007","volume":"29","author":[{"given":"Tessa","family":"Borgonjon","sequence":"first","affiliation":[]},{"given":"Broos","family":"Maenhout","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"issue":"2","key":"860_CR1","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2006.12.045","volume":"185","author":"K Abdelghany","year":"2008","unstructured":"Abdelghany, K., Abdelghany, A., & Ekollu, G. (2008). An integrated decision support tool for airlines schedule recovery during irregular operations. European Journal of Operational Research, 185(2), 825\u2013848.","journal-title":"European Journal of Operational Research"},{"key":"860_CR2","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/opre.21.3.693","volume":"21","author":"W Abernathy","year":"1973","unstructured":"Abernathy, W., Baloff, N., & Hershey, J. (1973). A three-stage manpower planning and scheduling model a service sector example. Operations Research, 21, 693\u2013711.","journal-title":"Operations Research"},{"key":"860_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0202001","volume":"2","author":"E Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E. (1973). The enumeration of maximal cliques of large graphs. SIAM Journal of Computing, 2, 1\u20136.","journal-title":"SIAM Journal of Computing"},{"issue":"11","key":"860_CR4","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.1016\/j.cor.2009.01.006","volume":"36","author":"F Ballest\u00edn","year":"2009","unstructured":"Ballest\u00edn, F., Valls, V., & Quintanilla, S. (2009). Scheduling projects with limited number of preemptions. Computers & Operations Research, 36(11), 2913\u20132925.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"860_CR5","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1016\/j.ejor.2006.07.052","volume":"189","author":"F Ballest\u00edn","year":"2008","unstructured":"Ballest\u00edn, F., Valls, V., & Quintanilla, S. (2008). Pre-emption in resource-constrained project scheduling. European Journal of Operational Research, 189(3), 1136\u20131152.","journal-title":"European Journal of Operational Research"},{"key":"860_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1080\/07408170590948468","volume":"37","author":"J Bard","year":"2005","unstructured":"Bard, J., & Purnomo, H. (2005). Hospital-wide reactive scheduling of nurses with preference considerations. IIE Transactions, 37, 589\u2013608.","journal-title":"IIE Transactions"},{"issue":"2","key":"860_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/j.1540-5915.1990.tb01692.x","volume":"21","author":"DB Bock","year":"1990","unstructured":"Bock, D. B., & Patterson, J. H. (1990). A comparison of due date setting, resource assignment, and job preemption heuristics for the multiproject scheduling problem. Decision Sciences, 21(2), 387\u2013402.","journal-title":"Decision Sciences"},{"key":"860_CR8","doi-asserted-by":"crossref","unstructured":"Borgonjon, T., & Maenhout, B. (2021). A two-phase pareto front method for solving the bi-objective personnel task rescheduling problem. Computers & Operations Research, 105624.","DOI":"10.1016\/j.cor.2021.105624"},{"issue":"2","key":"860_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.ejor.2021.03.047","volume":"296","author":"T Borgonjon","year":"2022","unstructured":"Borgonjon, T., & Maenhout, B. (2022). An exact approach for the personnel task rescheduling problem with task retiming. European Journal of Operational Research, 296(2), 465\u2013484.","journal-title":"European Journal of Operational Research"},{"key":"860_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108254","volume":"170","author":"T Borgonjon","year":"2022","unstructured":"Borgonjon, T., & Maenhout, B. (2022). A heuristic procedure for personnel task rescheduling with time-resource-quality trade-offs. Computers & Industrial Engineering, 170, Article 108254.","journal-title":"Computers & Industrial Engineering"},{"key":"860_CR11","doi-asserted-by":"crossref","unstructured":"Borgonjon, T., & Maenhout, B. (2024). A genetic algorithm for the personnel task rescheduling problem with time preemption. Expert Systems with Applications.","DOI":"10.1016\/j.eswa.2023.121868"},{"key":"860_CR12","doi-asserted-by":"crossref","unstructured":"Burke, E., De\u00a0Causmaecker, P., Petrovic, S., & Vanden\u00a0Berghe, G. (2004). Variable neighbourhood search for nurse rostering problems. In Resende, M. and Pinho\u00a0de Sousa, J., (Eds.), Metaheuristics: Computer decision-making (pp 153\u2013172). Kluwer Academic Publishers, Boston, MA.","DOI":"10.1007\/978-1-4757-4137-7_7"},{"issue":"2","key":"860_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.ejor.2019.04.025","volume":"278","author":"PM Castro","year":"2019","unstructured":"Castro, P. M., Harjunkoski, I., & Grossmann, I. E. (2019). Discrete and continuous-time formulations for dealing with break periods: Preemptive and non-preemptive scheduling. European Journal of Operational Research, 278(2), 563\u2013577.","journal-title":"European Journal of Operational Research"},{"key":"860_CR14","doi-asserted-by":"crossref","unstructured":"Chandrasekharan, R., Smet, P., & Wauters, T. (2021). An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. Journal of Heurstics.","DOI":"10.1007\/s10732-020-09439-9"},{"key":"860_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.24867\/IJIEM-2014-3-117","volume":"5","author":"A Delgoshaei","year":"2014","unstructured":"Delgoshaei, A., Ariffin, M. K., Baharudin, B., & Leman, Z. (2014). A backward approach for maximizing net present value of multimode pre-emptive resource-constrained project scheduling problem with discounted cash flows using simulated annealing algorithm. International Journal of Industrial Engineering and Management, 5, 151\u2013158.","journal-title":"International Journal of Industrial Engineering and Management"},{"key":"860_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-75504-3_9","volume-title":"Service Chain Management","author":"R Dorne","year":"2008","unstructured":"Dorne, R. (2008). Personnel shift scheduling and rostering. In C. Voudouris, D. Lesaint, & G. Owusu (Eds.), Service Chain Management (pp. 125\u2013138). Berlin Heidelberg: Springer."},{"key":"860_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"A Ernst","year":"2004","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004). An Annotated Bibliography of Personnel Scheduling and Rostering. Annals of Operations Research, 127, 21\u2013144.","journal-title":"Annals of Operations Research"},{"key":"860_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105742","volume":"142","author":"A Fomin","year":"2022","unstructured":"Fomin, A., & Goldengorin, B. (2022). An exact algorithm for the preemptive single machine scheduling of equal-length jobs. Computers & Operations Research, 142, Article 105742.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"860_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","volume":"297","author":"S Hartmann","year":"2022","unstructured":"Hartmann, S., & Briskorn, D. (2022). An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 297(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"860_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.cor.2018.07.010","volume":"100","author":"M Hojati","year":"2018","unstructured":"Hojati, M. (2018). A greedy heuristic for shift minimization personnel task scheduling problem. Computers & Operations Research, 100, 66\u201376.","journal-title":"Computers & Operations Research"},{"key":"860_CR21","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland, J. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"860_CR22","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 reserve duties on the robustness of a personnel shift roster: An empirical investigation. Computers & Operations Research, 61, 153\u2013169.","journal-title":"Computers & Operations Research"},{"key":"860_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/1467-9884.00091","volume":"46","author":"D Johnson","year":"1997","unstructured":"Johnson, D. (1997). The triangular distribution as a proxy for the beta distribution in risk analysis. The Statistician, 46, 387\u2013398.","journal-title":"The Statistician"},{"issue":"1","key":"860_CR24","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejor.2018.07.043","volume":"273","author":"D Kress","year":"2019","unstructured":"Kress, D., Dornseifer, J., & Jaehn, F. (2019). An exact solution approach for scheduling cooperative gantry cranes. European Journal of Operational Research, 273(1), 82\u2013101.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"860_CR25","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.ejor.2015.11.021","volume":"251","author":"S Kreter","year":"2016","unstructured":"Kreter, S., Rieck, J., & Zimmermann, J. (2016). Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars. European Journal of Operational Research, 251(2), 387\u2013403.","journal-title":"European Journal of Operational Research"},{"key":"860_CR26","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-1-4757-3333-4_20","volume":"52","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., & Ernst, A. (2001). The personnel task scheduling problem. Applied Optimization, 52, 343\u2013368.","journal-title":"Applied Optimization"},{"key":"860_CR27","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy, M., Ernst, A., & Baatar, D. (2012). Algorithms for large scale shift minimisation personnel task scheduling problems. European Journal of Operational Research, 219, 34\u201348.","DOI":"10.1016\/j.ejor.2011.11.034"},{"key":"860_CR28","doi-asserted-by":"publisher","first-page":"2450","DOI":"10.1016\/j.cor.2013.04.005","volume":"40","author":"T Lap\u00e8gue","year":"2013","unstructured":"Lap\u00e8gue, T., Prot, D., & Bellenguez-Morineau, O. (2013). A constraint-based approach for the shift design personnel task scheduling problem with equity. Computers & Operations Research, 40, 2450\u20132465.","journal-title":"Computers & Operations Research"},{"key":"860_CR29","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.cie.2017.09.045","volume":"113","author":"M Mac-Vicar","year":"2017","unstructured":"Mac-Vicar, M., Ferrer, J. C., Mu\u00f1oz, J. C., & Henao, C. A. (2017). Real-time recovering strategies on personnel scheduling in the retail industry. Computers & Industrial Engineering, 113, 589\u2013601.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"860_CR30","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.ejor.2018.03.005","volume":"269","author":"B Maenhout","year":"2018","unstructured":"Maenhout, B., & Vanhoucke, M. (2018). A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem. European Journal of Operational Research, 269(3), 806\u2013823.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"860_CR31","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2014.12.037","volume":"244","author":"A Moukrim","year":"2015","unstructured":"Moukrim, A., Quilliot, A., & Toussaint, H. (2015). An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration. European Journal of Operational Research, 244(2), 360\u2013368.","journal-title":"European Journal of Operational Research"},{"key":"860_CR32","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M Moz","year":"2007","unstructured":"Moz, M., & Pato, M. (2007). A genetic algorithm approach to a nurse rerostering problem. Computers & Operations Research, 34, 667\u2013691.","journal-title":"Computers & Operations Research"},{"key":"860_CR33","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10732-007-9040-4","volume":"14","author":"M Pato","year":"2008","unstructured":"Pato, M., & Moz, M. (2008). Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic. Journal of Heuristics, 14, 359\u2013374.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"860_CR34","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.scient.2011.05.017","volume":"18","author":"S Sadjadi","year":"2011","unstructured":"Sadjadi, S., Soltani, R., Izadkhah, M., Saberian, F., & Darayi, M. (2011). A new nonlinear stochastic staff scheduling model. Scientia Iranica, 18(3), 699\u2013710.","journal-title":"Scientia Iranica"},{"key":"860_CR35","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.omega.2014.12.004","volume":"53","author":"T Sawik","year":"2015","unstructured":"Sawik, T. (2015). On the fair optimization of cost and customer service level in a supply chain under disruption risks. Omega, 53, 58\u201366.","journal-title":"Omega"},{"key":"860_CR36","doi-asserted-by":"crossref","unstructured":"Shioura, A., Shakhlevich, N. V., & Strusevich, V. A. (2018). Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches. European Journal of Operational Research, 266(3), 795\u2013818.","DOI":"10.1016\/j.ejor.2017.08.034"},{"key":"860_CR37","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.neucom.2012.07.059","volume":"148","author":"Y Shou","year":"2015","unstructured":"Shou, Y., Li, Y., & Lai, C. (2015). Hybrid particle swarm optimization for preemptive resource-constrained project scheduling. Neurocomputing, 148, 122\u2013128.","journal-title":"Neurocomputing"},{"key":"860_CR38","unstructured":"Smet, P., & Vanden\u00a0Berghe, G. (2012). A matheuristic approach to the shift minimisation personnel task scheduling problem. In Proceedings of the 9th international conference on the practice and theory of automated timetabling. PATAT."},{"key":"860_CR39","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.fss.2009.10.003","volume":"161","author":"S Topaloglu","year":"2010","unstructured":"Topaloglu, S., & Selim, H. (2010). Nurse scheduling using fuzzy modelling approach. Fuzzy Sets and Systems, 161, 1543\u20131563.","journal-title":"Fuzzy Sets and Systems"},{"key":"860_CR40","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Van den Bergh","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., & De Boeck, L. (2013). Personnel scheduling: A literature review. European Journal of Operational Research, 226, 367\u2013385.","journal-title":"European Journal of Operational Research"},{"key":"860_CR41","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Van Peteghem","year":"2010","unstructured":"Van Peteghem, V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemtive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201, 409\u2013418.","journal-title":"European Journal of Operational Research"},{"key":"860_CR42","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.cie.2007.11.008","volume":"54","author":"M Vanhoucke","year":"2008","unstructured":"Vanhoucke, M. (2008). Setup times and fast tracking in resource-constrained project scheduling. Computers & Industrial Engineering, 54, 1062\u20131070.","journal-title":"Computers & Industrial Engineering"},{"key":"860_CR43","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. Transportation Research Part C-Emerging Technologies, 20, 95\u2013110.","journal-title":"Transportation Research Part C-Emerging Technologies"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00860-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00860-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00860-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:41:48Z","timestamp":1773657708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00860-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["860"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00860-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"22 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}