{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:37:38Z","timestamp":1773329858633,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10951-010-0211-z","type":"journal-article","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T19:44:15Z","timestamp":1292442255000},"page":"3-16","source":"Crossref","is-referenced-by-count":99,"title":["A categorisation of nurse rostering problems"],"prefix":"10.1007","volume":"14","author":[{"given":"Patrick","family":"De Causmaecker","sequence":"first","affiliation":[]},{"given":"Greet","family":"Vanden Berghe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"issue":"1","key":"211_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10479-007-0214-0","volume":"155","author":"U. Aickelin","year":"2007","unstructured":"Aickelin, U., & Li, J. (2007). An estimation of distribution algorithm for nurse scheduling. Annals of Operations Research, 155(1), 289\u2013309.","journal-title":"Annals of Operations Research"},{"issue":"12","key":"211_CR2","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1057\/palgrave.jors.2602308","volume":"58","author":"U. Aickelin","year":"2007","unstructured":"Aickelin, U., Burke, E. K., & Li, J. (2007). An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. Journal of the Operational Research Society, 58(12), 1574\u20131585.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"211_CR3","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"M. N. Azaiez","year":"2005","unstructured":"Azaiez, M. N., & Al-Sharif, S. S. (2005). A 0-1 goal programming model for nurse scheduling. Computers and Operations Research, 32(3), 507\u2013491.","journal-title":"Computers and Operations Research"},{"key":"211_CR4","first-page":"139","volume":"39","author":"J. F. Bard","year":"2005","unstructured":"Bard, J. F., & Purnomo, H. W. (2005a). A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio-Economic Planning Sciences, 39, 139\u2013213.","journal-title":"Socio-Economic Planning Sciences"},{"key":"211_CR5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ejor.2003.06.046","volume":"164","author":"J. F. Bard","year":"2005","unstructured":"Bard, J. F., & Purnomo, H. W. (2005b). Preference scheduling for nurses using column generation. European Journal of Operational Research, 164, 510\u2013534.","journal-title":"European Journal of Operational Research"},{"key":"211_CR6","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1080\/07408170590948468","volume":"37","author":"J. F. Bard","year":"2005","unstructured":"Bard, J. F., & Purnomo, H. W. (2005c). Hospital-wide reactive scheduling of nurses with preference considerations. IIE Transactions, 37, 589\u2013608.","journal-title":"IIE Transactions"},{"key":"211_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10729-006-6281-y","volume":"9","author":"J. F. Bard","year":"2006","unstructured":"Bard, J. F., & Purnomo, H. W. (2006). Incremental changes in the workforce to accommodate changes in demand. Health Care Management Science, 9, 71\u201385.","journal-title":"Health Care Management Science"},{"issue":"1","key":"211_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-006-0323-7","volume":"10","author":"J. F. Bard","year":"2007","unstructured":"Bard, J. F., & Purnomo, H. W. (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. Journal of Scheduling, 10(1), 5\u201323.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"211_CR9","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2004.12.028","volume":"10","author":"G. R. Beddoe","year":"2006","unstructured":"Beddoe, G. R., & Petrovic, S. (2006). Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. European Journal of Operational Research, 10(1), 649\u2013671.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"211_CR10","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1057\/palgrave.jors.2602304","volume":"58","author":"G. R. Beddoe","year":"2007","unstructured":"Beddoe, G. R., & Petrovic, S. (2007). Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. Journal of the Operational Research Society, 58(12), 1586\u20131598.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"211_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10951-008-0082-8","volume":"12","author":"G. Beddoe","year":"2009","unstructured":"Beddoe, G., Petrovic, S., & Li, J. (2009). A hybrid metaheuristic case-based reasoning system for nurse rostering. Journal of Scheduling, 12(2), 99\u2013119.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"211_CR12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"153","author":"F. Bellanti","year":"2004","unstructured":"Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy-based neighbourhood search approach to a nurse rostering problem. European Journal of Operational Research, 153(1), 28\u201340.","journal-title":"European Journal of Operational Research"},{"key":"211_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10951-007-0035-7","volume":"10","author":"M. J. Bester","year":"2007","unstructured":"Bester, M. J., Nieuwoudt, I., & Van\u00a0Vuuren, J. H. (2007). Finding good nurse duty schedules: a case study. Journal of Scheduling, 10, 387\u2013405.","journal-title":"Journal of Scheduling"},{"key":"211_CR14","unstructured":"Bilgin, B., De Causmaecker, P., Rossie, B., & Vanden Berghe, G. (2011). Local search neighbourhoods for dealing with a novel nurse rostering model. Annals of Operations Research, accepted."},{"key":"211_CR15","volume-title":"Proceedings of the 7th international conference on practice and theory of automated timetabling","author":"B. Bilgin","year":"2008","unstructured":"Bilgin, B., De Causmaecker, P., Rossie, B., & Vanden Berghe, G. (2008). Local search neighbourhoods to deal with a novel nurse rostering model. In Proceedings of the 7th international conference on practice and theory of automated timetabling, Montreal, August 2008."},{"key":"211_CR16","doi-asserted-by":"crossref","unstructured":"Bourdais, S., Galinier, Ph., & Pesant, G. (2003). Hibiscus: A constraint programming application to staff scheduling in health care. In Lecture notes in computer science. CP 2003 (Vol.\u00a02833, pp. 153\u2013167).","DOI":"10.1007\/978-3-540-45193-8_11"},{"key":"211_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms (4th ed.). Berlin: Springer.","edition":"4"},{"key":"211_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112, 3\u201341.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"211_CR19","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10732-008-9099-6","volume":"16","author":"P. Brucker","year":"2010","unstructured":"Brucker, P., Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2010). Adaptive construction of nurse schedules: A shift sequence based approach. Journal of Heuristics 16(4), 559\u2013573.","journal-title":"Journal of Heuristics"},{"key":"211_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001a). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199\u2013214. Special issue on simulated evolution and learning.","journal-title":"Applied Intelligence"},{"key":"211_CR21","first-page":"1139","volume-title":"Proceedings of the congress on evolutionary computation (CEC2001)","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2001b). Fitness evaluation for nurse scheduling problems. In Proceedings of the congress on evolutionary computation (CEC2001) (pp.\u00a01139\u20131146), Seoul, Korea, May 27\u201330, 2001. New York: IEEE Press."},{"issue":"6","key":"211_CR22","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"9","key":"211_CR23","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1080\/08839510600903841","volume":"20","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2006). Metaheuristics for handling time interval coverage constraints in nurse scheduling. Applied Artificial Intelligence, 20(9), 743\u2013766.","journal-title":"Applied Artificial Intelligence"},{"key":"211_CR24","unstructured":"Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2007). A time pre-defined variable depth search for nurse rostering (Technical report). University of Nottingham."},{"key":"211_CR25","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"E. K. Burke","year":"2008","unstructured":"Burke, E. K., Curtois, T., Post, G., Qu, R., & Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research, 188, 330\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"211_CR26","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1057\/jors.2009.118","volume":"61","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Curtois, T., Qu, R., & Vanden Berghe, G. (2010). A scatter search approach for the nurse rostering problem. Journal of the Operational Research Society, 61, 1667\u20131679.","journal-title":"Journal of the Operational Research Society"},{"key":"211_CR27","first-page":"298","volume-title":"Proceedings of the 3th international conference on the practice and theory of automated timetabling","author":"M. Chiarandini","year":"2000","unstructured":"Chiarandini, M., Schaerf, A., & Tiozzo, F. (2000). Solving employee timetabling problems with flexible workload using tabu search. In E. K. Burke & W. Erben (Eds.), Proceedings of the 3th international conference on the practice and theory of automated timetabling, PATAT (pp.\u00a0298\u2013302). Konstanz, Germany, August 2000."},{"key":"211_CR28","first-page":"951","volume-title":"Proceedings of the 17th national conference on AAAI and 12th conference on IAAI","author":"A. H. W. Chun","year":"2000","unstructured":"Chun, A. H. W., Chan, S. H. C., Lam, G. P. S., Tsang, F. M. P., Wong, J., & Yeung, D. W. M. (2000). Nurse rostering at the hospital authority of Hong Kong. In Proceedings of the 17th national conference on AAAI and 12th conference on IAAI (pp. 951\u2013956)."},{"key":"211_CR29","volume-title":"The practice and theory of automated timetabling, proceedings of the 5th international conference","author":"P. De Causmaecker","year":"2008","unstructured":"De Causmaecker, P. (2008). Towards a reference model for timetabling and rostering. In E. K. Burke & M. Gendreau (Eds.), The practice and theory of automated timetabling, proceedings of the 5th international conference, Montreal, August 2008."},{"key":"211_CR30","series-title":"Lecture notes in computer science:","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-45157-0_9","volume-title":"Practice and theory of automated timetabling","author":"P. Causmaecker De","year":"2003","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2003). Relaxation of coverage constraints in hospital personnel rostering. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. Practice and theory of automated timetabling (pp. 129\u2013147). Berlin: Springer."},{"key":"211_CR31","unstructured":"De\u00a0Causmaecker P., & Vanden\u00a0Berghe G. (2011). Towards a reference model for timetabling and rostering. Annals of Operations Research, accepted."},{"key":"211_CR32","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1111\/1475-3995.00406","volume":"10","author":"T. M. Dias","year":"2003","unstructured":"Dias, T. M., Ferber, D. F., de Sousa, C. C., & Moura, A. V. (2003). Constructing nurse schedules at large hospitals. International Transactions in Operational Research 10, 245\u2013265.","journal-title":"International Transactions in Operational Research"},{"key":"211_CR33","first-page":"180","volume-title":"Proceedings of the 1st multidisciplinary international conference on scheduling: Theory and applications (MISTA)","author":"A. Duenas","year":"2003","unstructured":"Duenas, A., Mort, N., Reeves, C., & Petrovic, D. (2003). Handling preferences using genetic algorithms for the nurse scheduling problem. In G. Kendall, E.K. Burke, & S. Petrovic (Eds.), Proceedings of the 1st multidisciplinary international conference on scheduling: Theory and applications (MISTA) Nottingham, UK (pp. 180\u2013196)."},{"key":"211_CR34","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H. Dyckhoff","year":"1990","unstructured":"Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44, 145\u2013159.","journal-title":"European Journal of Operational Research"},{"key":"211_CR35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"211_CR36","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W. J. Gutjahr","year":"2007","unstructured":"Gutjahr, W. J., & Rauner, M. S. (2007). An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Computers & Operations Research, 34(3), 642\u2013666.","journal-title":"Computers & Operations Research"},{"key":"211_CR37","unstructured":"Herroelen, W., Demeulemeester, E., & De Reyck, B. (1999). A classification scheme for project scheduling. International series in operations research and management science: Vol.\u00a014 (pp.\u00a077\u2013106). Project scheduling\u2014recent models, algorithms and applications. Kluwer Academic Publishers."},{"key":"211_CR38","volume-title":"Handbook in operations research and management science","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Handbook in operations research and management science. Vol.\u00a04. Amsterdam: North Holland."},{"issue":"1","key":"211_CR39","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ergon.2008.05.001","volume":"39","author":"E. J. Lodree Jr.","year":"2009","unstructured":"Lodree, E. J. Jr., Geiger, C. D., & Jiang, X. (2009). Taxonomy for integrating scheduling theory and human factors: Review and research opportunities. International Journal of Industrial Ergonomics, 39(1), 39\u201351.","journal-title":"International Journal of Industrial Ergonomics"},{"issue":"1","key":"211_CR40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10479-007-0268-z","volume":"159","author":"B. Maenhout","year":"2008","unstructured":"Maenhout, B., & Vanhoucke, M. (2008). Comparison and hybridization of crossover operators for the nurse scheduling problem. Annals of Operations Research, 159(1), 333\u2013353.","journal-title":"Annals of Operations Research"},{"key":"211_CR41","volume-title":"Proceedings of the 21st Benelux conference on artificial intelligence","author":"T. Messelis","year":"2009","unstructured":"Messelis, T., Haspeslagh, S., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2009). Towards prediction of algorithm performance in real world optimisation problems. In Proceedings of the 21st Benelux conference on artificial intelligence (Vol.\u00a021, pp.\u00a0177\u2013183), BNAIC. Eindhoven, October 2009."},{"issue":"3","key":"211_CR42","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M. Moz","year":"2007","unstructured":"Moz, M., & Pato, M. V. (2007). A genetic algorithm approach to a nurse rerostering problem. Computers & Operations Research, 34(3), 667\u2013691.","journal-title":"Computers & Operations Research"},{"key":"211_CR43","unstructured":"Osogami, T., & Imai, H. Classification of various neighborhood operations for the nurse scheduling problem (Technical Report 135). The Institute of Statistical Mathematics."},{"key":"211_CR44","series-title":"Lecture notes in computer science:","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/11569596_51","volume-title":"Computer and information sciences\u2014Proceedings ISCIS","author":"E. Ozcan","year":"2005","unstructured":"Ozcan, E. (2005). Memetic algorithms for nurse rostering. In Lecture notes in computer science: Vol.\u00a03733. Computer and information sciences\u2014Proceedings ISCIS (pp. 482\u2013492)."},{"issue":"1","key":"211_CR45","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10479-007-0202-4","volume":"155","author":"D. Parr","year":"2007","unstructured":"Parr, D., & Thompson, J. M. (2007). Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research, 155(1), 279\u2013288. Special issue on personnel scheduling and planning.","journal-title":"Annals of Operations Research"},{"key":"211_CR46","volume-title":"Scheduling, theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling, theory, algorithms, and systems (2nd ed.). New York: Prentice Hall.","edition":"2"},{"key":"211_CR47","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0377-2217(92)90075-K","volume":"60","author":"S. P. Siferd","year":"1992","unstructured":"Siferd, S. P. & Benton, W.C. (1992). Workforce staffing and scheduling: Hospital nursing specific models. European Journal of Operational Research, 60, 233\u2013246.","journal-title":"European Journal of Operational Research"},{"key":"211_CR48","series-title":"Lecture notes in artificial intelligence:","first-page":"54","volume-title":"IEA\/AIE 2007","author":"S. Topaloglu","year":"2007","unstructured":"Topaloglu, S. & Selim, H. (2007). Nurse scheduling using fuzzy multiple objective programming. In H. G. Okuno & M. Ali (Eds.), Lecture notes in artificial intelligence: Vol.\u00a04570. IEA\/AIE 2007 (pp. 54\u201363). Berlin: Springer."},{"key":"211_CR49","first-page":"151","volume-title":"Operational research for health policy: making better decisions, proceedings of the 31st annual meeting of the working group on operations research applied to health services","author":"M. Vanhoucke","year":"2007","unstructured":"Vanhoucke, M., & Maenhout, B. (2007). NSPLib\u2014a nurse scheduling problem library: a tool to evaluate (meta-)heuristic procedures. In S. Brailsford & P. Harper (Eds.), Operational research for health policy: making better decisions, proceedings of the 31st annual meeting of the working group on operations research applied to health services (pp. 151\u2013165)."},{"issue":"2","key":"211_CR50","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2008.03.044","volume":"196","author":"M. Vanhoucke","year":"2009","unstructured":"Vanhoucke, M., & Maenhout, B. (2009). On the characterisation and generation of nurse scheduling problem instances. European Journal of Operational Research, 196(2), 457\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"211_CR51","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Haussner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"211_CR52","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.engappai.2004.08.001","volume":"17","author":"G. Y. C. Wong","year":"2004","unstructured":"Wong, G. Y. C. & Chun A.H.W. (2004). Constraint-based rostering using meta-level reasoning and probability-based ordering. Engineering Applications of Artificial Intelligence, 17(6), 599\u2013610.","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0211-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T03:38:25Z","timestamp":1559878705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0211-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["211"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0211-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,16]]}}}