{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T18:38:04Z","timestamp":1773167884588,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,30]],"date-time":"2012-11-30T00:00:00Z","timestamp":1354233600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10951-012-0299-4","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T15:40:17Z","timestamp":1354203617000},"page":"231-242","source":"Crossref","is-referenced-by-count":34,"title":["Cyclic staff scheduling: optimization models for some real-life problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Marta","family":"Rocha","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Maria Ant\u00f3nia","family":"Carravilla","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,30]]},"reference":[{"key":"299_CR1","unstructured":"Abdennadher, S., & Schlenker, H. (1999). Nurse scheduling using constraint logic programming. In Proceedings of the 11th conference on innovative applications of artificial intelligence, pp. 838\u2013843."},{"issue":"1\u20134","key":"299_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000019103.31340.a6","volume":"128","author":"U Aickelin","year":"2004","unstructured":"Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128(1\u20134), 159\u2013177.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"299_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/B:ANOR.0000019088.98647.e2","volume":"127","author":"H Alfares","year":"2004","unstructured":"Alfares, H. (2004). Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research, 127(1), 145\u2013175.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"299_CR4","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"M Azaiez","year":"2005","unstructured":"Azaiez, M. (2005). A 0\u20131 goal programming model for nurse scheduling. Computers & Operations Research, 32(3), 491\u2013507.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"299_CR5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1057\/jors.1976.30","volume":"27","author":"KR Baker","year":"1976","unstructured":"Baker, K. R. (1976). Workforce allocation in cyclical scheduling problems: A survey. Operational Research Quarterly, 27(1), 155\u2013167.","journal-title":"Operational Research Quarterly"},{"key":"299_CR6","doi-asserted-by":"crossref","unstructured":"Balakrishnan, N., & Wong, R. T. (1990). A network model for the rotating workforce scheduling problem. Networks, 20, 25\u201342.","DOI":"10.1002\/net.3230200103"},{"issue":"5","key":"299_CR7","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1016\/S0305-0548(02)00048-5","volume":"30","author":"JF Bard","year":"2003","unstructured":"Bard, J. F., Binici, C., & DeSilva, A. H. (2003). Staff scheduling at the United States Postal Service. Computers & Operations Research, 30(5), 745\u2013771.","journal-title":"Computers & Operations Research"},{"issue":"11","key":"299_CR8","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"S Bechtold","year":"1990","unstructured":"Bechtold, S., & Jacobs, L. (1990). Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36(11), 1339\u20131351.","journal-title":"Management Science"},{"issue":"3","key":"299_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0377-2217(03)00387-4","volume":"158","author":"I Bl\u00f6chliger","year":"2004","unstructured":"Bl\u00f6chliger, I. (2004). Modeling staff scheduling problems. A tutorial. European Journal of Operational Research, 158(3), 533\u2013542.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"299_CR10","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/S0377-2217(97)81461-0","volume":"95","author":"M Brusco","year":"1996","unstructured":"Brusco, M., & Johns, T. (1996). A sequential integer programming method for discontinuous labor tour scheduling. European Journal of Operational Research, 95(3), 537\u2013548.","journal-title":"European Journal of Operational Research"},{"key":"299_CR11","unstructured":"Burke, E., Causmaecker, P.D., & Berghe, G.V. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In Lecture Notes in Artificial Intelligence (Vol. 1585, pp. 187\u2013194). Berlin: Springer."},{"issue":"3","key":"299_CR12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke, E., Cowling, P., De Causmaecker, P., & Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3), 199\u2013214.","journal-title":"Applied Intelligence"},{"issue":"6","key":"299_CR13","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E Burke","year":"2004","unstructured":"Burke, E., De Causmaecker, P., Berghe, G. V., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"key":"299_CR14","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., & Woodward, J. R. (2010a). A classification of hyper-heuristic approaches. In M. Gendreau & J. Y. Potvin (Eds.), Handbook of metaheuristics. International Series in Operations Research & Management Science, (Vol. 146, pp. 449\u2013468). Berlin: Springer.","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"299_CR15","doi-asserted-by":"crossref","unstructured":"Burke, E., Li, J., & Qu, R. (2010b). A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research, 203(2), 484\u2013493.","DOI":"10.1016\/j.ejor.2009.07.036"},{"issue":"2","key":"299_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.cmpb.2010.03.015","volume":"100","author":"RC Carrasco","year":"2010","unstructured":"Carrasco, R. C. (2010). Long-term staff scheduling with regular temporal distribution. Computer methods and programs in biomedicine, 100(2), 191\u20139.","journal-title":"Computer methods and programs in biomedicine"},{"key":"299_CR17","unstructured":"Burke, E., & Soubeiga, E. (2003). Scheduling nurses using a tabu-search hyperheuristic. In Proceedings of the 1st multidisciplinary international conference on scheduling: Theory and applications (MISTA 2003), Nottingham, UK, pp. 180\u2013197."},{"issue":"3","key":"299_CR18","doi-asserted-by":"crossref","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\u2014a comment on edie\u2019s \u201ctraffic delays at toll booths\u201d. Operations Research, 2(3), 339\u2013341.","journal-title":"Operations Research"},{"issue":"1","key":"299_CR19","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-010-0211-z","volume":"14","author":"P Causmaecker De","year":"2010","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2010a). A categorisation of nurse rostering problems. Journal of Scheduling, 14(1), 3\u201316.","journal-title":"Journal of Scheduling"},{"key":"299_CR20","doi-asserted-by":"crossref","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2010b). Towards a reference model for timetabling and rostering. Annals of Operations Research, 177, 1\u201310.","DOI":"10.1007\/s10479-010-0721-2"},{"issue":"1\u20134","key":"299_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/B:ANOR.0000019096.58882.54","volume":"127","author":"G Eitzen","year":"2004","unstructured":"Eitzen, G., Panton, D., & Mills, G. (2004). Multi-skilled workforce optimisation. Annals of Operations Research, 127(1\u20134), 359\u2013372.","journal-title":"Annals of Operations Research"},{"key":"299_CR22","unstructured":"Enz, C. A. (2009). Key issues of concern in the lodging industry: What worries managers. Cornell Hospitality Report 4. The Center for Hospitality Research, School of Hotel Administration, Cornell University."},{"issue":"1\u20134","key":"299_CR23","doi-asserted-by":"crossref","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. (2004a). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127(1\u20134), 21\u2013144.","journal-title":"Annals of Operations Research"},{"key":"299_CR24","doi-asserted-by":"crossref","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004b). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1), 3\u201327.","DOI":"10.1016\/S0377-2217(03)00095-X"},{"issue":"2","key":"299_CR25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1287\/msom.5.2.79.16071","volume":"5","author":"N Gans","year":"2003","unstructured":"Gans, N., Koole, G., & Mandelbaum, A. (2003). Telephone call centers: Tutorial, review, and research prospects. Manufacturing and Service Operations Management, 5(2), 79\u2013141.","journal-title":"Manufacturing and Service Operations Management"},{"issue":"2","key":"299_CR26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ejor.2009.05.046","volume":"202","author":"CA Glass","year":"2010","unstructured":"Glass, C. A., & Knight, R. A. (2010). The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research, 202(2), 379\u2013389.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"299_CR27","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1057\/palgrave.jors.2600803","volume":"50","author":"G Laporte","year":"1999","unstructured":"Laporte, G. (1999). The art and science of designing rotating schedules. The Journal of the Operational Research Society, 50(10), 1011\u20131017.","journal-title":"The Journal of the Operational Research Society"},{"issue":"11","key":"299_CR28","doi-asserted-by":"crossref","first-page":"1208","DOI":"10.1057\/palgrave.jors.2601789","volume":"55","author":"G Laporte","year":"2004","unstructured":"Laporte, G., & Pesant, G. (2004). A general multi-shift scheduling system. Journal of the Operational Research Society, 55(11), 1208\u20131217.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"299_CR29","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1111\/j.1540-5915.1991.tb00361.x","volume":"22","author":"J Loucks","year":"1991","unstructured":"Loucks, J., & Jacobs, F. (1991). Tour scheduling and task assignment of a heterogeneous work force: A heuristic approach. Decision Sciences, 22(4), 719\u2013738.","journal-title":"Decision Sciences"},{"key":"299_CR30","doi-asserted-by":"crossref","unstructured":"Misir, M., Verbeeck, K., De Causmaecker, P., & Berghe, G. (2010). Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In IEEE Congress on Evolutionary Computation (IEEE CEC), 2010, pp. 1\u20138.","DOI":"10.1109\/CEC.2010.5586348"},{"key":"299_CR31","doi-asserted-by":"crossref","unstructured":"Mora, M., & Musliu, N. (2004). Genetic algorithm for rotating workforce scheduling problem. In Computational cybernetics, 2004. ICCC 2004. Second IEEE international conference on IEEE, pp. 121\u2013126.","DOI":"10.1109\/ICCCYB.2004.1437685"},{"key":"299_CR32","doi-asserted-by":"crossref","unstructured":"Morris, J. G., & Showalter, M. J. (1983). Simple approaches to shift, days-off and tour scheduling problems. Management Science, 29(8), 942\u2013950.","DOI":"10.1287\/mnsc.29.8.942"},{"key":"299_CR33","doi-asserted-by":"crossref","unstructured":"Moz, M., & Pato, M. V. (2004). Solving the problem of rerostering nurse schedules with hard constraints: New multicommodity flow models. Annals of Operations Research, 1976, 179\u2013197.","DOI":"10.1023\/B:ANOR.0000019104.39239.ed"},{"issue":"4","key":"299_CR34","doi-asserted-by":"crossref","first-page":"309","DOI":"10.5019\/j.ijcir.2006.69","volume":"2","author":"N Musliu","year":"2006","unstructured":"Musliu, N. (2006). Heuristic methods for automatic rotating workforce scheduling. International Journal of Computational Intelligence Research, 2(4), 309\u2013326.","journal-title":"International Journal of Computational Intelligence Research"},{"issue":"1","key":"299_CR35","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10479-007-0212-2","volume":"155","author":"H Ni","year":"2007","unstructured":"Ni, H., & Abeledo, H. (2007). A branch-and-price approach for large-scale employee tour scheduling problems. Annals of Operations Research, 155(1), 167\u2013176.","journal-title":"Annals of Operations Research"},{"key":"299_CR36","unstructured":"Qu, R., & He, F. (2009). A hybrid constraint programming approach for nurse rostering problems. In T. Allen, R. Ellis, & M. Petridis (Eds.), Applications and innovations in intelligent systems XVI, 28th SGAI international conference on innovative techniques and applications of artificial intelligence, Cambridge (pp. 211\u2013224). London: Springer."},{"issue":"1","key":"299_CR37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-009-0114-z","volume":"13","author":"M Rekik","year":"2009","unstructured":"Rekik, M., Cordeau, J. F., & Soumis, F. (2009). Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling, 13(1), 49\u201375.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"299_CR38","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.cie.2010.05.005","volume":"59","author":"A Rong","year":"2010","unstructured":"Rong, A. (2010). Monthly tour scheduling models with mixed skills considering weekend off requirements. Computers & Industrial Engineering, 59(2), 334\u2013343.","journal-title":"Computers & Industrial Engineering"},{"key":"299_CR39","first-page":"163","volume":"24","author":"M Sellmann","year":"2000","unstructured":"Sellmann, M., Zervoudakis, K., Stamatopoulos, P., & Fahle, T. (2000). Integrating direct CP search and CP-based column generation for the airline crew assignment problem. Transportation Science, 24, 163\u2013170.","journal-title":"Transportation Science"},{"issue":"2","key":"299_CR40","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.ejor.2004.03.048","volume":"170","author":"GM Thompson","year":"2006","unstructured":"Thompson, G. M., & Goodale, J. C. (2006). Variable employee productivity in workforce scheduling. European Journal of Operational Research, 170(2), 376\u2013390.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"299_CR41","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000019102.68222.df","volume":"128","author":"S Topaloglu","year":"2004","unstructured":"Topaloglu, S., & Ozkarahan, I. (2004). An implicit goal programming model for the tour scheduling problem considering the employee work preferences. Annals of Operations Research, 128(1\u20134), 135\u2013158.","journal-title":"Annals of Operations Research"},{"key":"299_CR42","first-page":"53","volume-title":"Handbook of work stress","author":"P Totterdell","year":"2005","unstructured":"Totterdell, P. (2005). Work schedules. In J. Barling, E. K. Kelloway, & M. R. Frone (Eds.), Handbook of work stress (p. 53). London: Sage Publishers."},{"issue":"2","key":"299_CR43","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ejor.2006.10.030","volume":"183","author":"S Ulusam Se\u00e7kiner","year":"2007","unstructured":"Ulusam Se\u00e7kiner, S., & G\u00f6k\u00e7en, H. (2007). An integer programming model for hierarchical workforce scheduling problem. European Journal of Operational Research, 183(2), 694\u2013699.","journal-title":"European Journal of Operational Research"},{"key":"299_CR44","doi-asserted-by":"crossref","unstructured":"Valouxis, C., & Housos, E. (2000). Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine, 20(2), 155\u2013175.","DOI":"10.1016\/S0933-3657(00)00062-2"},{"issue":"5","key":"299_CR45","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.24.5.842","volume":"24","author":"DM Warner","year":"1976","unstructured":"Warner, D. M. (1976). Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research, 24(5), 842\u2013856.","journal-title":"Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0299-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0299-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0299-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T03:37:01Z","timestamp":1562384221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0299-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,30]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["299"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0299-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,30]]}}}