{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T10:37:00Z","timestamp":1768819020840,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,3]],"date-time":"2008-09-03T00:00:00Z","timestamp":1220400000000},"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":[[2009,4]]},"DOI":"10.1007\/s10951-008-0082-8","type":"journal-article","created":{"date-parts":[[2008,9,2]],"date-time":"2008-09-02T13:52:22Z","timestamp":1220363542000},"page":"99-119","source":"Crossref","is-referenced-by-count":58,"title":["A hybrid metaheuristic case-based reasoning system for\u00a0nurse\u00a0rostering"],"prefix":"10.1007","volume":"12","author":[{"given":"Gareth","family":"Beddoe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanja","family":"Petrovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,3]]},"reference":[{"issue":"3","key":"82_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., & Dowsland, K. A. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3(3), 139\u2013153.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"82_CR2","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":"3","key":"82_CR3","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"M. N. Azaiez","year":"2005","unstructured":"Azaiez, M. N., & Sharif, S. S. A. (2005). A 0-1 goal programming model for nurse scheduling. Computers & Operations Research, 32(3), 451\u2013507.","journal-title":"Computers & Operations Research"},{"key":"82_CR4","first-page":"27","volume":"14","author":"R. N. Bailey","year":"1997","unstructured":"Bailey, R. N., Garner, K. M., & Hobbs, M. F. (1997). Using simulated annealing and genetic algorithms to solve staff scheduling problems. Asia-Pacific Journal of Operational Research, 14, 27\u201343.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"82_CR5","first-page":"58","volume":"15","author":"D. Beasley","year":"1993","unstructured":"Beasley, D., Bull, D., & Martin, R. (1993). An overview of genetic algorithms: Part 1, fundamentals. University Computing, 15(2), 58\u201369.","journal-title":"University Computing"},{"issue":"2","key":"82_CR6","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2004.12.028","volume":"175","author":"G. Beddoe","year":"2006","unstructured":"Beddoe, G., & 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, 175(2), 649\u2013671.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"82_CR7","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 Vuuren, J. H. (2007). Finding good nurse duty schedules: a case study. Journal of Scheduling, 10(6), 387\u2013405.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"82_CR8","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. I., De Causmaecker, P., & Vanden Berghe,\u00a0G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3), 199\u2013214.","journal-title":"Applied Intelligence"},{"key":"82_CR9","author":"E. K. Burke","year":"2008","unstructured":"Burke, E. K., Curtois, T., Post, G., Qu, R., & Veltman, B. (2008). A\u00a0hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research. doi: 10.1016\/j.ejor.2007.04.030 .","journal-title":"European Journal of Operational Research"},{"key":"82_CR10","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-48873-1_25","volume-title":"Simulated evolution and learning","author":"E. K. Burke","year":"1999","unstructured":"Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A\u00a0hybrid tabu search algorithm for the nurse rostering problem. In B.\u00a0McKay, X.\u00a0Yao, C. Newton, J. Kim, & T. Furuhashi (Eds.), Lecture notes in artificial intelligence : Vol. 1585. Simulated evolution and learning (pp. 187\u2013194). Berlin: Springer."},{"issue":"6","key":"82_CR11","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":"6","key":"82_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451\u2013470.","journal-title":"Journal of Heuristics"},{"key":"82_CR13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0950-7051(00)00057-5","volume":"13","author":"E. K. Burke","year":"2000","unstructured":"Burke, E. K., MacCarthy, B., Petrovic, S., & Qu, R. (2000). Structured cases in case-based reasoning\u2014re-using and adapting cases for time-tabling problems. Knowledge-Based Systems, 13, 159\u2013165.","journal-title":"Knowledge-Based Systems"},{"key":"82_CR14","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1995). A memetic algorithm for university exam timetabling. In 1st international conference on the practice and theory of automated timetabling (ICPTAT\u201995), Napier University, Edinburgh, UK, 30th\u00a0Aug\u20131st\u00a0Sept. 1995 (pp.\u00a0496\u2013503)."},{"issue":"2","key":"82_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115\u2013132.","journal-title":"Journal of Scheduling"},{"key":"82_CR16","author":"M. V. Chiaramonte","year":"2008","unstructured":"Chiaramonte, M. V., & Chiaramonte, L. M. (2008). An agent-based nurse rostering system under minimal staffing conditions. International Journal of Production Economics. doi: 10.1016\/j.ijpe.2008.03.004 .","journal-title":"International Journal of Production Economics"},{"issue":"11","key":"82_CR17","doi-asserted-by":"crossref","first-page":"2947","DOI":"10.1080\/002075497194237","volume":"35","author":"P. Cunningham","year":"1997","unstructured":"Cunningham, P., & Smyth, B. (1997). Case-based reasoning in scheduling: reusing solution components. International Journal of Production Research, 35(11), 2947\u20132961.","journal-title":"International Journal of Production Research"},{"key":"82_CR18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K. Dowsland","year":"1998","unstructured":"Dowsland, K. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393\u2013407.","journal-title":"European Journal of Operational Research"},{"key":"82_CR19","volume-title":"Genetic algorithms in search, optimisation, and machine learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic algorithms in search, optimisation, and machine learning. Reading: Addison-Wesley."},{"key":"82_CR20","volume-title":"Adaption in natural and artificial systems","author":"J. Holland","year":"1975","unstructured":"Holland, J. (1975). Adaption in natural and artificial systems. Cambridge: MIT Press."},{"key":"82_CR21","first-page":"37","volume":"11","author":"K. Kempf","year":"1991","unstructured":"Kempf, K., LePape, C., Smith, C., & Fox, B. R. (1991). Issues in the design of AI-based schedulers: workshop report. Artificial Intelligence Magazine, 11, 37\u201346.","journal-title":"Artificial Intelligence Magazine"},{"key":"82_CR22","doi-asserted-by":"crossref","DOI":"10.1016\/B978-1-55860-237-3.50005-4","volume-title":"Case-based reasoning","author":"J. L. Kolodner","year":"1993","unstructured":"Kolodner, J. L. (1993). Case-based reasoning. San Mateo: Morgan Kaufmann."},{"key":"82_CR23","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/S0377-2217(03)00134-6","volume":"156","author":"P. Legato","year":"2004","unstructured":"Legato, P., & Monaco, M. F. (2004). Human resources management at a marine container terminal. European Journal of Operational Research, 156, 769\u2013781.","journal-title":"European Journal of Operational Research"},{"key":"82_CR24","unstructured":"Li, J., & Aickelin, U. (2003). A Bayesian optimization algorithm for the nurse scheduling problem. In 2003 congress on evolutionary computation (pp. 2149\u20132156)."},{"key":"82_CR25","unstructured":"MacCarthy, B. L., & Jou, P. (1995). A case-based expert system for scheduling problems with sequence dependent set up times. In Applications of artificial intelligence in engineering (pp. 89\u201396)."},{"key":"82_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/BFb0055885","volume-title":"Practice and theory of automated timetabling: selected papers from PATAT 1997","author":"A. Meisels","year":"1998","unstructured":"Meisels, A., & Lusternik, N. (1998). Experiments on networks of employee timetabling problems. In E. Burke & M. Carter (Eds.), Lecture notes in computer science : Vol. 1408. Practice and theory of automated timetabling: selected papers from PATAT 1997 (pp. 130\u2013141). Berlin: Springer."},{"key":"82_CR27","series-title":"Lecture notes on computer science","first-page":"280","volume-title":"Selected papers from the 3rd international conference on practice and theory of automated timetabling (PATAT)","author":"H. Meyer auf\u2019m Hofe","year":"2000","unstructured":"Meyer auf\u2019m Hofe, H. (2000). Solving rostering tasks as constraint optimization. In Lecture notes on computer science. Selected papers from the 3rd international conference on practice and theory of automated timetabling (PATAT) (pp. 280\u2013297). Berlin: Springer."},{"key":"82_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04131-4","volume-title":"How to solve it: modern heuristics","author":"Z. Michalewicz","year":"2000","unstructured":"Michalewicz, Z., & Fogel, D. B. (2000). How to solve it: modern heuristics. Berlin: Springer."},{"issue":"5","key":"82_CR29","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.24.5.857","volume":"24","author":"H. E. Miller","year":"1976","unstructured":"Miller, H. E., Pierskalla, W. P., & Rath, G. J. (1976). Nurse scheduling using mathematical programming. Operations Research, 24(5), 857\u2013870.","journal-title":"Operations Research"},{"key":"82_CR30","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0004-3702(94)00089-J","volume":"76","author":"K. Miyashita","year":"1995","unstructured":"Miyashita, K., & Sycara, K. (1995). CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artificial Intelligence, 76, 377\u2013426.","journal-title":"Artificial Intelligence"},{"key":"82_CR31","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/0-387-27744-7_14","volume-title":"Multidisciplinary scheduling: theory and applications","author":"S. Petrovic","year":"2005","unstructured":"Petrovic, S., Yang, Y., & Dror, M. (2005). Case-based initialisation for examination timetabling. In G. Kendall, E. Burke, S. Petrovic, & M. Gendreau (Eds.), Multidisciplinary scheduling: theory and applications (pp. 289\u2013308). Berlin: Springer."},{"key":"82_CR32","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0004-3702(95)00078-S","volume":"76","author":"N. Sadeh","year":"1995","unstructured":"Sadeh, N., Sycara, K., & Xiong, Y. (1995). Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 76, 455\u2013480.","journal-title":"Artificial Intelligence"},{"key":"82_CR33","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/S0925-5273(97)00141-2","volume":"56\u201357","author":"G. Schmidt","year":"1998","unstructured":"Schmidt, G. (1998). Case-based reasoning for production scheduling. International Journal of Production Economics, 56\u201357, 537\u2013546.","journal-title":"International Journal of Production Economics"},{"key":"82_CR34","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/BFb0056350","volume-title":"Advances in case-based reasoning\u2014EWCBR98","author":"S. Scott","year":"1998","unstructured":"Scott, S., & Simpson, R. (1998). Case-bases incorporating scheduling constraint dimensions\u2014experiences in nurse rostering. In Lecture notes in artificial intelligence. Advances in case-based reasoning\u2014EWCBR98 (pp. 392\u2013401). Berlin: Springer."},{"key":"82_CR35","doi-asserted-by":"crossref","unstructured":"Smith, B. M., & Bennett, S. (1992). Combining constraint satisfaction and local improvement algorithms to construct anaesthetists\u2019 rotas. In Proceedings of the conference on artificial intelligence applications (CAIA92) (pp.\u00a0106\u2013112).","DOI":"10.1109\/CAIA.1992.200017"},{"key":"82_CR36","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/BFb0056334","volume-title":"Proceedings of the European workshop on case based reasoning","author":"B. Smyth","year":"1998","unstructured":"Smyth, B., & McKenna, E. (1998). Modelling the competence of case-bases. In Proceedings of the European workshop on case based reasoning, Dublin, Ireland (pp. 208\u2013220). Berlin: Springer."},{"key":"82_CR37","unstructured":"Sqalli, M. H., & Freuder, E. C. (1998). Integration of CSP and CBR to compensate for incompleteness and incorrectness of models. In Proceedings of the AAAI-98 spring symposium on multimodal reasoning, Stanford University."},{"key":"82_CR38","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0950-7051(99)00020-9","volume":"12","author":"I. Watson","year":"1999","unstructured":"Watson, I. (1999). Case-based reasoning is a methodology not a technology. Knowledge-Based Systems, 12, 303\u2013308.","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"82_CR39","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1017\/S0269888900007098","volume":"9","author":"I. Watson","year":"1994","unstructured":"Watson, I., & Marir, F. (1994). Case-based reasoning: A review. The Knowledge Engineering Review, 9(2), 327\u2013354.","journal-title":"The Knowledge Engineering Review"},{"key":"82_CR40","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-61794-9_51","volume-title":"Practice and theory of automated timetabling","author":"A. Wren","year":"1996","unstructured":"Wren, A. (1996). Scheduling, timetabling and rostering\u2014a special relationship? In E. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling (pp. 46\u201375). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0082-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0082-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0082-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:41Z","timestamp":1559468381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0082-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,3]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0082-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,3]]}}}