{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:21:12Z","timestamp":1743078072647,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_4","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"46-61","source":"Crossref","is-referenced-by-count":8,"title":["A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem"],"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":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"issue":"4","key":"4_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.: Optimal shift scheduling with multiple break windows. Management Science\u00a042(4), 591\u2013602 (1996)","journal-title":"Management Science"},{"key":"4_CR3","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 modeling approaches to the labor shift scheduling problem. European J. of Operational Research\u00a0125, 381\u2013397 (2000)","journal-title":"European J. of Operational Research"},{"issue":"11","key":"4_CR4","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 modeling of flexible break assignments in optimal shift scheduling. Management Science\u00a036(11), 1339\u20131351 (1990)","journal-title":"Management Science"},{"issue":"2","key":"4_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"},{"key":"4_CR6","doi-asserted-by":"crossref","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 (2009)","DOI":"10.1007\/s10601-009-9083-2"},{"key":"4_CR7","first-page":"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":"4_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"490","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a0490(1-3), 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"key":"4_CR9","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.: The minimum shift design problem. Annals of Operations Research\u00a0155, 79\u2013105 (2007)","journal-title":"Annals of Operations Research"},{"issue":"8","key":"4_CR10","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.: EASYLOCAL++: An object-oriented framework for flexible design of local search algorithms. Software \u2014 Practice & Experience\u00a033(8), 733\u2013765 (2003)","journal-title":"Software \u2014 Practice & Experience"},{"key":"4_CR11","volume-title":"Stochastic Local Search Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)"},{"key":"4_CR12","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, G., Kochenberger, F. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"issue":"1","key":"4_CR13","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 J. of Operational Research\u00a0153(1), 51\u201364 (2004)","journal-title":"European J. of Operational Research"},{"key":"4_CR14","unstructured":"Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16 (2009)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-30201-8_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"L. Perron","year":"2004","unstructured":"Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 468\u2013481. Springer, Heidelberg (2004)"},{"issue":"3","key":"4_CR16","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. J. of Heuristics\u00a016(3), 373\u2013391 (2010)","journal-title":"J. of Heuristics"},{"issue":"1","key":"4_CR17","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. J. of Scheduling\u00a013(1), 49\u201375 (2010)","journal-title":"J. of Scheduling"},{"key":"4_CR18","unstructured":"Gecode Team. Gecode: Generic constraint development environment, http:\/\/www.gecode.org"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","first-page":"293","volume-title":"Practice and Theory of Automated Timetabling VI","author":"P. Tellier","year":"2006","unstructured":"Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 293\u2013302. Springer, Heidelberg (2006)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 7th International Workshop on Hybrid Metaheuristics (HM 2010)","author":"M. Widl","year":"2010","unstructured":"Widl, M., Musliu, N.: An improved memetic algorithm for break scheduling. In: Proceedings of the 7th International Workshop on Hybrid Metaheuristics (HM 2010). LNCS, Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T01:00:39Z","timestamp":1559696439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}