{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:19:17Z","timestamp":1770229157750,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T00:00:00Z","timestamp":1697328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T00:00:00Z","timestamp":1697328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RDC 530544-18"],"award-info":[{"award-number":["RDC 530544-18"]}],"id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10951-023-00794-6","type":"journal-article","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T08:01:40Z","timestamp":1697356900000},"page":"165-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5122-3130","authenticated-orcid":false,"given":"Rachid","family":"Hassani","sequence":"first","affiliation":[]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[]},{"given":"Issmail","family":"Elhallaoui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,15]]},"reference":[{"key":"794_CR1","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1051\/ro\/2021027","volume":"55","author":"M Abdelghany","year":"2021","unstructured":"Abdelghany, M., Yahia, Z., & Eltawil, A. B. (2021). A new two-stage variable neighborhood search algorithm for the nurse rostering problem. RAIRO, 55, 673\u2013687.","journal-title":"RAIRO"},{"key":"794_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/mnsc.42.4.591","volume":"42","author":"T Aykin","year":"1996","unstructured":"Aykin, T. (1996). Optimal shift scheduling with multiple break windows. Management Science, 42, 591\u2013602.","journal-title":"Management Science"},{"key":"794_CR3","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1080\/07408170590948468","volume":"37","author":"JF Bard","year":"2005","unstructured":"Bard, J. F., & Purnomo, H. W. (2005). Hospital-wide reactive scheduling of nurses with preference considerations. IIE Transactions, 37, 589\u2013608.","journal-title":"IIE Transactions"},{"key":"794_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1019009928005","volume":"3","author":"H Beaulieu","year":"2000","unstructured":"Beaulieu, H., Ferland, J. A., Gendron, B., & Michelon, P. (2000). A mathematical programming approach for scheduling physicians in the emergency room. Health Care Management Science, 3, 193\u2013200.","journal-title":"Health Care Management Science"},{"key":"794_CR5","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"SE Bechtold","year":"1990","unstructured":"Bechtold, S. E., & Jacobs, L. W. (1990). Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36, 1339\u20131351.","journal-title":"Management Science"},{"key":"794_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10479-016-2175-7","volume":"252","author":"A Bonutti","year":"2017","unstructured":"Bonutti, A., Ceschia, S., De Cesco, F., Musliu, N., & Schaerf, A. (2017). Modeling and solving a real-life multi-skill shift design problem. Annals of Operations Research, 252, 365\u2013382.","journal-title":"Annals of Operations Research"},{"key":"794_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10951-013-0338-9","volume":"17","author":"V Boyer","year":"2014","unstructured":"Boyer, V., Gendron, B., & Rousseau, L. M. (2014). A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. Journal of Scheduling, 17, 185\u2013197.","journal-title":"Journal of Scheduling"},{"key":"794_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E Burke","year":"2004","unstructured":"Burke, E., De Causmaecker, P., & Vanden Berghe, G. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7, 441\u2013499.","journal-title":"Journal of Scheduling"},{"key":"794_CR9","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/ijoc.1120.0510","volume":"25","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2013). A time predefined variable depth search for nurse rostering. INFORMS Journal on Computing, 25, 411\u2013419.","journal-title":"INFORMS Journal on Computing"},{"key":"794_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108430","volume":"171","author":"Z Chen","year":"2022","unstructured":"Chen, Z., Dou, Y., & De Causmaecker, P. (2022). Neural networked-assisted method for the nurse rostering problem. Computers & Industrial Engineering, 171, 108430.","journal-title":"Computers & Industrial Engineering"},{"key":"794_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1287\/mnsc.1100.1264","volume":"57","author":"MC C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M. C., Gendron, B., & Rousseau, L. M. (2011). Grammar-based integer programming models for multiactivity shift scheduling. Management Science, 57, 151\u2013163.","journal-title":"Management Science"},{"key":"794_CR12","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/opre.2.3.339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G. B. (1954). Letter to the editor-A comment on Edie\u2019s traffic delays at toll booths. Journal of the Operations Research Society of America, 2, 339\u2013341.","journal-title":"Journal of the Operations Research Society of America"},{"key":"794_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0221-1","volume":"155","author":"L Di Gaspero","year":"2007","unstructured":"Di Gaspero, L., G\u00e4rtner, J., Kortsarz, G., Musliu, N., Schaerf, A., & Slany, W. (2007). The minimum shift design problem. Annals of Operations Research, 155, 79\u2013105.","journal-title":"Annals of Operations Research"},{"key":"794_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.2.2.107","volume":"2","author":"LC Edie","year":"1954","unstructured":"Edie, L. C. (1954). Traffic delays at toll booths. Journal of the Operations Research Society of America, 2, 107\u2013138.","journal-title":"Journal of the Operations Research Society of America"},{"key":"794_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"AT Ernst","year":"2004","unstructured":"Ernst, A. T., 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":"794_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/mnsc.1030.0142","volume":"50","author":"G Felici","year":"2004","unstructured":"Felici, G., & Gentile, C. (2004). A polyhedral approach for the staff rostering problem. Management Science, 50, 381\u2013393.","journal-title":"Management Science"},{"key":"794_CR17","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13, 533\u2013549.","journal-title":"Computers & Operations Research"},{"key":"794_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F. (1996). Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics, 65, 223\u2013253.","journal-title":"Discrete Applied Mathematics"},{"key":"794_CR19","unstructured":"Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. Congress on Numerical Methods in Combinatorial Optimization (pp. 70\u2013145). Italy: Capri."},{"key":"794_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2020.12.013","volume":"293","author":"R Hassani","year":"2021","unstructured":"Hassani, R., Desaulniers, G., & Elhallaoui, I. (2021). Real-time bi-objective personnel re-scheduling in the retail industry. European Journal of Operational Research, 293, 93\u2013108.","journal-title":"European Journal of Operational Research"},{"key":"794_CR21","first-page":"199","volume":"23","author":"E Jacquet-Lagr\u00e8ze","year":"1998","unstructured":"Jacquet-Lagr\u00e8ze, E., Montaut, D., & Partouche, A. (1998). The shift scheduling problem: Different formulations and solution methods. Foundations of Computing and Decision Sciences, 23, 199\u2013217.","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"794_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"794_CR23","unstructured":"Kitada, M., & Morizawa, K. (2013). A heuristic method for nurse rerostering problem with a sudden absence for several consecutive days. International Journal of Emerging Technology and Advanced Engineering, 3, 353\u2013361."},{"key":"794_CR24","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.cie.2012.05.005","volume":"63","author":"Q Lequy","year":"2012","unstructured":"Lequy, Q., Desaulniers, G., & Solomon, M. M. (2012). A two-stage heuristic for multi-activity and task assignment to work shifts. Computers & Industrial Engineering, 63, 831\u2013841.","journal-title":"Computers & Industrial Engineering"},{"key":"794_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0108-x","volume":"13","author":"B Maenhout","year":"2010","unstructured":"Maenhout, B., & Vanhoucke, M. (2010). Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. Journal of Scheduling, 13, 77\u201393.","journal-title":"Journal of Scheduling"},{"key":"794_CR26","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. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"794_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(03)00098-5","volume":"153","author":"N Musliu","year":"2004","unstructured":"Musliu, N., Schaerf, A., & Slany, W. (2004). Local search for shift design. European Journal of Operational Research, 153, 51\u201364.","journal-title":"European Journal of Operational Research"},{"key":"794_CR28","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10732-009-9106-6","volume":"16","author":"CG Quimper","year":"2010","unstructured":"Quimper, C. G., & Rousseau, L. M. (2010). A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics, 16, 373\u2013392.","journal-title":"Journal of Heuristics"},{"key":"794_CR29","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.ejor.2016.09.030","volume":"258","author":"E Rahimian","year":"2017","unstructured":"Rahimian, E., Akartunal\u0131, K., & Levine, J. (2017). A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems. European Journal of Operational Research, 258, 411\u2013423.","journal-title":"European Journal of Operational Research"},{"key":"794_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10951-009-0114-z","volume":"13","author":"M Rekik","year":"2010","unstructured":"Rekik, M., Cordeau, J. F., & Soumis, F. (2010). Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling, 13, 49\u201375.","journal-title":"Journal of Scheduling"},{"key":"794_CR31","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1287\/ijoc.2015.0683","volume":"28","author":"MI Restrepo","year":"2016","unstructured":"Restrepo, M. I., Gendron, B., & Rousseau, L. M. (2016). Branch-and-price for personalized multiactivity tour scheduling. INFORMS Journal on Computing, 28, 334\u2013350.","journal-title":"INFORMS Journal on Computing"},{"key":"794_CR32","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159, 139\u2013171.","journal-title":"Journal of Computational Physics"},{"key":"794_CR33","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"GM Thompson","year":"1995","unstructured":"Thompson, G. M. (1995). Improved implicit optimal modeling of the labor shift scheduling problem. Management Science, 41, 595\u2013607.","journal-title":"Management Science"},{"key":"794_CR34","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"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00794-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-023-00794-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-023-00794-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T12:04:34Z","timestamp":1712491474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-023-00794-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,15]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["794"],"URL":"https:\/\/doi.org\/10.1007\/s10951-023-00794-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,15]]},"assertion":[{"value":"10 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}