{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:26:00Z","timestamp":1762251960353,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393037"},{"type":"electronic","value":"9783642393044"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39304-4_5","type":"book-chapter","created":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T09:09:45Z","timestamp":1373620185000},"page":"109-127","source":"Crossref","is-referenced-by-count":9,"title":["Automated Shift Design and Break Scheduling"],"prefix":"10.1007","author":[{"given":"Luca","family":"Di Gaspero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"G\u00e4rtner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Schafhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Slany","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/mnsc.42.4.591","volume":"42","author":"T. Aykin","year":"1996","unstructured":"Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science\u00a042, 591\u2013603 (1996)","journal-title":"Management Science"},{"key":"5_CR2","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.: A comparative evaluation of modelling approaches to the labour shift scheduling problem. European Journal of Operational Research\u00a0125, 381\u2013397 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"S.E. Bechtold","year":"1990","unstructured":"Bechtold, S.E., Jacobs, L.W.: Implicit modelling of flexible break assignments in optimal shift scheduling. Management Science\u00a036(11), 1339\u20131351 (1990)","journal-title":"Management Science"},{"unstructured":"Beer, A., Gaertner, J., Musliu, N., Schafhauser, W., Slany, W.: 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 (2008)","key":"5_CR4"},{"issue":"2","key":"5_CR5","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.: An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems\u00a025(2), 60\u201373 (2010)","journal-title":"IEEE Intelligent Systems"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10601-009-9083-2","volume":"16","author":"M.-C. C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints\u00a016(1), 55\u201376 (2011)","journal-title":"Constraints"},{"issue":"1","key":"5_CR7","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.: Grammar-based integer programming models for multiactivity shift scheduling. Management Science\u00a057(1), 151\u2013163 (2011)","journal-title":"Management Science"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/opre.2.3.339","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"Dantzig, G.B.: A comment on Eddie\u2019s traffic delays at toll booths. Operations Research\u00a02, 339\u2013341 (1954)","journal-title":"Operations Research"},{"issue":"1-3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a049(1-3), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"key":"5_CR10","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.: The minimum shift design problem. Annals of Operations Research\u00a0155, 79\u2013105 (2007)","journal-title":"Annals of Operations Research"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L. Di Gaspero","year":"2003","unstructured":"Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 262\u2013275. Springer, Heidelberg (2003)"},{"issue":"2","key":"5_CR12","first-page":"83","volume":"14","author":"J. G\u00e4rtner","year":"2001","unstructured":"G\u00e4rtner, J., Musliu, N., Slany, W.: Rota: a research project on algorithms for workforce scheduling and shift design optimization. AI Commun.\u00a014(2), 83\u201392 (2001)","journal-title":"AI Commun."},{"unstructured":"G\u00e4rtner, J., Musliu, N., Slany, W.: 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 (2004)","key":"5_CR13"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-39658-1_54","volume-title":"Algorithms - ESA 2003","author":"L. Di Gaspero","year":"2003","unstructured":"Di Gaspero, L., G\u00e4rtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W.: The minimum shift design problem: Theory and practice. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 593\u2013604. Springer, Heidelberg (2003)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","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.: A hybrid LS-CP solver for the shifts and breaks design problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol.\u00a06373, pp. 46\u201361. Springer, Heidelberg (2010)"},{"key":"5_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search. Kluwer Academic Publishers, Dordrecht (1997)"},{"unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications. Elsevier \/ Morgan Kaufmann (2004)","key":"5_CR17"},{"issue":"1-3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell.\u00a058(1-3), 161\u2013205 (1992)","journal-title":"Artif. Intell."},{"issue":"1","key":"5_CR19","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.: Local search for shift design. European Journal of Operational Research\u00a0153(1), 51\u201364 (2004)","journal-title":"European Journal of Operational Research"},{"unstructured":"Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: 8th Metaheuristic International Conference, Hamburg, Germany (2009)","key":"5_CR20"},{"unstructured":"Musliu, N.: Intelligent Search Methods for Workforce Scheduling: New Ideas and Practical Applications. PhD thesis, Vienna University of Technology (2001)","key":"5_CR21"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.5019\/j.ijcir.2006.69","volume":"2","author":"N. Musliu","year":"2006","unstructured":"Musliu, N.: Heuristic methods for automatic rotating workforce scheduling. International Journal of Computational Intelligence Research\u00a02(4), 309\u2013326 (2006)","journal-title":"International Journal of Computational Intelligence Research"},{"unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall (1982)","key":"5_CR23"},{"issue":"3","key":"5_CR24","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.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics\u00a016(3), 373\u2013391 (2010)","journal-title":"Journal of Heuristics"},{"key":"5_CR25","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.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling\u00a013, 49\u201375 (2010)","journal-title":"Journal of Scheduling"},{"unstructured":"Schafhauser, W.: TEMPLE - A Domain Specific Language for Modeling and Solving Real-Life Staff Scheduling Problems. PhD thesis, Vienna University of Technology (2010)","key":"5_CR26"},{"unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability (1993)","key":"5_CR27"},{"unstructured":"Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudova, H. (eds.) The 5th International Conference on the Practice and Theory of Automated Timetabling, pp. 293\u2013302 (2006)","key":"5_CR28"},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"G. Thompson","year":"1995","unstructured":"Thompson, G.: Improved implicit modeling of the labor shift scheduling problem. Management Science\u00a041(4), 595\u2013607 (1995)","journal-title":"Management Science"},{"unstructured":"Widl, M.: Memetic algorithms for break scheduling. Master\u2019s thesis, Vienna University of Technology, Vienna, Austria (2010), \n                    http:\/\/www.kr.tuwien.ac.at\/staff\/widl\/thesis.pdf","key":"5_CR30"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-16054-7_10","volume-title":"Hybrid Metaheuristics","author":"M. Widl","year":"2010","unstructured":"Widl, M., Musliu, N.: An improved memetic algorithm for break scheduling. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol.\u00a06373, pp. 133\u2013147. Springer, Heidelberg (2010)"}],"container-title":["Studies in Computational Intelligence","Automated Scheduling and Planning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39304-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T16:50:40Z","timestamp":1706201440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-39304-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393037","9783642393044"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39304-4_5","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}