{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T15:12:32Z","timestamp":1778512352834,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T00:00:00Z","timestamp":1460332800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-016-2175-7","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T06:27:30Z","timestamp":1460615250000},"page":"365-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Modeling and solving a real-life multi-skill shift design problem"],"prefix":"10.1007","volume":"252","author":[{"given":"Alex","family":"Bonutti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"De Cesco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3992-8637","authenticated-orcid":false,"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,11]]},"reference":[{"key":"2175_CR1","volume-title":"Simulated annealing and Boltzmann machines","author":"EHL Aarts","year":"1989","unstructured":"Aarts, E. H. L., & Korst, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley."},{"issue":"1\u20134","key":"2175_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/B:ANOR.0000019088.98647.e2","volume":"127","author":"HK Alfares","year":"2004","unstructured":"Alfares, H. K. (2004). Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research, 127(1\u20134), 145\u2013175.","journal-title":"Annals of Operations Research"},{"key":"2175_CR3","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\u2013603.","journal-title":"Management Science"},{"key":"2175_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/S0377-2217(99)00413-0","volume":"125","author":"T Aykin","year":"2000","unstructured":"Aykin, T. (2000). A comparative evaluation of modelling approaches to the labour shift scheduling problem. European Journal of Operational Research, 125, 381\u2013397.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2175_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 modelling of flexible break assignments in optimal shift scheduling. Management Science, 36(11), 1339\u20131351.","journal-title":"Management Science"},{"key":"2175_CR6","unstructured":"Beer, A., G\u00e4rtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2008). Scheduling breaks in shift plans for call centers. In Proceedings of The 7th international conference on the practice and theory of automated timetabling. Montreal, Canada."},{"issue":"2","key":"2175_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MIS.2010.40","volume":"25","author":"A Beer","year":"2010","unstructured":"Beer, A., G\u00e4rtner, J., Musliu, N., Schafhauser, W., & Slany, W. (2010). An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems, 25(2), 60\u201373.","journal-title":"IEEE Intelligent Systems"},{"issue":"3","key":"2175_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/msom.1070.0172","volume":"10","author":"S Bhulai","year":"2008","unstructured":"Bhulai, S., Koole, G., & Pot, A. (2008). Simple methods for shift scheduling in multiskill call centers. Manufacturing & Service Operations Management, 10(3), 411\u2013420.","journal-title":"Manufacturing & Service Operations Management"},{"key":"2175_CR9","unstructured":"Birattari, M. (2004). The problem of tuning metaheuristics as seen from a machine learning perspective, PhD thesis. Belgium: Universit\u00e9 Libre de Bruxelles."},{"issue":"l","key":"2175_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u00fd","year":"1985","unstructured":"\u010cern\u00fd, V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45(l), 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"2175_CR11","first-page":"55","volume":"16","author":"M-C C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.-C., Gendron, B., Quimper, C.-G., & Rousseau, L.-M. (2011). Formal languages for integer programming modeling of shift scheduling problems. Constraints, 16(1), 55\u201376.","journal-title":"Constraints"},{"issue":"1","key":"2175_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1287\/mnsc.1100.1264","volume":"57","author":"M-C 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(1), 151\u2013163.","journal-title":"Management Science"},{"key":"2175_CR13","first-page":"339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G. B. (1954). A comment on Eddie\u2019s traffic delays at toll booths. Operations Research, 2, 339\u2013341.","journal-title":"Operations Research"},{"issue":"1","key":"2175_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0221-1","volume":"155","author":"L Gaspero Di","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(1), 79\u2013105.","journal-title":"Annals of Operations Research"},{"key":"2175_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-16054-7_4","volume-title":"Hybrid metaheuristics","author":"L Di Gaspero","year":"2010","unstructured":"Di Gaspero, L., G\u00e4rtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2010). A hybrid LS-CP solver for the shifts and breaks design problem. In M. J. Blesa, C. Blum, G. Raidl, A. Roli, & M. Sampels (Eds.), Hybrid metaheuristics (pp. 46\u201361). Berlin: Springer."},{"key":"2175_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-39304-4_5","volume-title":"Automated scheduling and planning","author":"L Di Gaspero","year":"2013","unstructured":"Di Gaspero, L., G\u00e4rtner, J., Musliu, N., Schaerf, A., Schafhauser, W., & Slany, W. (2013). Automated shift design and break scheduling. In S. A. Uyar, E. Ozcan, & N. Urquhart (Eds.), Automated scheduling and planning (pp. 109\u2013127). Berlin: Springer."},{"issue":"8","key":"2175_CR17","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Software-Practice and Experience, 33(8), 733\u2013765.","journal-title":"Software-Practice and Experience"},{"key":"2175_CR18","unstructured":"G\u00e4rtner, J., Musliu, N., & Slany, W. (2004). A heuristic based system for generation of shifts with breaks. In Proceedings of the 24th SGAI international conference on innovative techniques and applications of artificial intelligence, Cambridge."},{"key":"2175_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1063\/1.3047186","volume":"18","author":"JM Hammersley.","year":"1965","unstructured":"Hammersley., J. M., Handscomb, D. C., & Weiss, G. (1965). Monte Carlo methods. Physics Today, 18, 55.","journal-title":"Physics Today"},{"issue":"6","key":"2175_CR20","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"DS Johnson","year":"1989","unstructured":"Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989). Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research, 37(6), 865\u2013892.","journal-title":"Operations Research"},{"key":"2175_CR21","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, D., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"issue":"1","key":"2175_CR22","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(1), 51\u201364.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2175_CR23","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10732-009-9106-6","volume":"16","author":"C-G 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(3), 373\u2013391.","journal-title":"Journal of Heuristics"},{"key":"2175_CR24","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"},{"issue":"1\u20134","key":"2175_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/B:ANOR.0000019101.29692.2c","volume":"128","author":"M Rekik","year":"2004","unstructured":"Rekik, M., Cordeau, J.-F., & Soumis, F. (2004). Using benders decomposition to implicitly model tour scheduling. Annals of Operations Research, 128(1\u20134), 111\u2013133.","journal-title":"Annals of Operations Research"},{"key":"2175_CR26","unstructured":"Tellier, P., & White, G. (2006). Generating personnel schedules in an industrial setting using a tabu search algorithm. In E. K. Burke & H. Rudova (Eds.), In The 5th international conference on the practice and theory of automated timetabling (pp. 293\u2013302)."},{"issue":"4","key":"2175_CR27","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"G Thompson","year":"1995","unstructured":"Thompson, G. (1995). Improved implicit modeling of the labor shift scheduling problem. Management Science, 41(4), 595\u2013607.","journal-title":"Management Science"},{"key":"2175_CR28","unstructured":"Urli, T. (2013). json2run: A tool for experiment design & analysis. \n                        arXiv:1305.1112\n                        \n                    ."},{"key":"2175_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: Theory and applications","author":"PJM Laarhoven van","year":"1987","unstructured":"van Laarhoven, P. J. M., & Aarts, E. H. L. (1987). Simulated annealing: Theory and applications. New York: Kluwer."},{"issue":"2","key":"2175_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s12293-014-0131-0","volume":"6","author":"M Widl","year":"2014","unstructured":"Widl, M., & Musliu, N. (2014). The break scheduling problem: Complexity results and practical algorithms. Memetic Computing, 6(2), 97\u2013112.","journal-title":"Memetic Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2175-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2175-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:20Z","timestamp":1559138960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2175-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,11]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2175"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2175-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,11]]}}}