Enhancing case-based reasoning for personnel rostering with selected tabu search concepts

Journal of the Operational Research Society

Volumn 58, Issue 12, 2007, Pages 1586-1598

  Beddoe, G ^a,b   Petrovic, S ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b Medicsight PLC   (United Kingdom)

Author keywords

Case based reasoning; Personnel rostering; Scheduling; Tabu search

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; SCHEDULING; TABU SEARCH;

HARD CONSTRAINTS; PERSONNEL ROSTERING; SOFT CONSTRAINTS; STAFF SATISFACTION;

CASE BASED REASONING;

EID: 36248959636     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602304     Document Type: Article

References (38)

1. Abdennadher S and Schlenker H (1999). INTERDIP - an interactive constraint based nurse scheduler. In: Little J (ed). Proceedings of The First International Conference and Exhibition on the Practical Application of Constraint Technologies and Logic Programming (PACLP). The Practical Applications Company: London, UK.
2. Alvarez-Valdes R, Crespo E and Tamarit JM (1999). Labour scheduling at an airport refuelling installation. J Opl Res Soc 50: 211-218.
3. Arthur JL and Ravindran A (1981). A multiple objective nurse scheduling model. AIIE Trans 13: 55-60.
4. Bailey J (1985). Integrated days off and shift personnel scheduling. Comput Indust Eng 9: 395-404.
5. Bailey J and Field J (1985). Personnel scheduling with flexshift models. J Opns Mngt 5: 327-338.
6. Bailey RN, Garner KM and Hobbs MF (1997). Using simulated annealing and genetic algorithms to solve staff scheduling problems. Asia-Pacific J Opl Res 14: 27-43.
7. Beaumont N (1997a). Scheduling staff using mixed integer programming. Eur J OpI Res 98: 473-484.
8. Beaumont N (1997b). Using mixed integer programming to design employee rosters. J Opl Res Soc 48: 585-590.
9. Beddoe GR and Petrovic S (2004). Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. Eur J Opl Res, accepted for publication.
10. Berrada I, Ferland JA and Michelon P (1996). A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Econ Planning Sci 30: 183-193.
11. Burke EK, De Causmaecker P and Vanden Berghe G (1998). A hybrid tabu search algorithm for the nurse rostering problem. In: McKay B, Yao X, Newton CS, Kim J-H and Furuhashi T (eds). Selected Papers from the Second Asia Pacific Conference on Simulated Evolution and Learning Volume. Canberra, Australia, Vol. 1585 of Lecture Notes in Artificial Intelligence. Springer-Verlag: Berlin, pp 187-194.
12. Burke EK, De Causmaecker P, Vanden Berghe G and Van Landeghem H (2004). The state of the art of nurse rostering. J Scheduling 7: 441-499.
13. Burke EK, Kendall G and Soubeiga E (2003). A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9: 451-470.
14. Burke EK, MacCarthy BL, Petrovic S and Qu R (2006). Multiple-retrieval case-based reasoning for course timetable problems. J Opl Res Soc 57: 148-162.
15. Burke EK, MacCarthy B, Petrovic S and Qu R (2000). Structured cases in case-based reasoning-re-using and adapting cases for time-tabling problems. Knowledge-Based Systems 13: 159-165.
16. Burke EK, Petrovic S and Qu R (2006). Case-based heuristic selection for timetabling problems. / Scheduling 9: 99-113.
17. Burns RN and Carter MW (1985). Work force size and single shift schedules with variable demands. Mngt Sci 31: 599-607.
18. Cavique L, Rego C and Themido I (1999). Subgraph ejection chains and tabu search for the crew scheduling problem. J Opl Res Soc 50: 608-616.
19. Cheng BMW, Lee JHM and Wu JCK (1996). A constraint-based nurse rostering system using a redundant modeling approach. Technical report, Department of Computer Science and Engineering at The Chinese University of Hong Kong.
20. Cunningham P and Smyth B (1997). Case-based reasoning in scheduling: reusing solution components. Int J Production Res 35: 2947-2961.
21. Dowsland K (1998). Nurse scheduling with tabu search and strategic oscillation. Eur J Opl Res 106: 393-407.
22. Dowsland KA and Thompson JM (2000). Solving a nurse scheduling problem with knapsacks, networks, and tabu search. J Opl Res Soc 51: 825-833.
23. Duenas A, Mort N, Reeves C and Petrovic D (2003). Handling preferences using genetic algorithms for the nurse scheduling problem. In: Kendall G, Burke E and Petrovic S (eds). Proceedings of the First Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Nottingham, United Kingdom, Vol. 1. Automated Scheduling Optimisation and Planning Research Group, pp 180-196.
24. Glover F (1989). Tabu search - part I. ORSA J Comput 1: 190-206.
25. Kobbacy KAH (2004). On the evolution of an intelligent maintenance optimization system. J OpI Res Soc 55: 139-146.
26. Kobbacy KOH and Jeon J (2001). The development of a hybrid intelligent maintenance optimisation system (HIMOS). J OpI Res Soc 52: 762-778.
27. Kolodner JL (1993). Case-Based Reasoning. Morgan Kaufmann Publishers Inc.: San Francisco, USA.
28. Meyer auf'm Hofe H (2000). Solving rostering tasks as constraint optimization. In: Burke E., Erben W (eds). Selected Papers from the Third International Conference on Practice and Theory of Automated Timetabling (PATAT), Konstanz, Germany, Lecture Notes on Computer Science, Vol. 2079. Springer-Verlag: Berlin, pp 280-297.
29. Michalewicz Z and Fogel DB (2000). How to Solve It: Modern Heuristics. Springer: Berlin, Germany.
30. Miyashita K and Sycara K (1995a). CABINS: a framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair. Artif Intel J 76: 377-426.
31. Miyashita K and Sycara K (1995b). Improving system performance in case-based iterative optimization through knowledge filtering. In: Proceedings of the International Joint Conference on Artificial Intelligence UCAI'95. Morgan Kaufmann: Los Altos: CA. Montreal, Canada, pp 371-376.
32. Miyashita K, Sycara K and Mizoguchi R (1994). Capturing scheduling knowledge from repair experiences. Int J Hum-Comput Studies 41: 751-773.
33. Miyashita K, Sycara K and Mizoguchi R (1996). Modeling illstructured optimization tasks through cases. Decision Support Systems 17: 345-364.
34. Petrovic S, Beddoe GR and Vanden Berghe G (2003). Storing and adapting repair experiences in employee rostering. In: Burke E., De Causmaecker P (eds). Practice and Theory of Automated Timetabling IV-Selected Papers from PATAT'2002, Gent, Belgium, Lecture Notes in Computer Science, Vol. 2740. Springer-Verlag: Berlin, pp 149-166.
35. Pierskalla WP and Rath GJ (1976). Nurse scheduling using mathematical programming. Opns Res 24: 857-870.
36. Schmidt G (1998). Case-based reasoning for production scheduling. Int J Production Econ 56-57: 537-546.
37. Scott S and Simpson R (1998). Case-bases incorporating scheduling constraint dimensions-experiences in nurse rostering. In: Cunningham P., Smyth B (eds). Advances in Case-Based Reasoning-EWCBR, Dublin, Ireland, Lecture Notes in Artificial Intelligence, Vol. 1488. Springer-Verlag: Berlin, pp 392-401.
38. Warner M (1976). Scheduling nursing personnel, according to nurse preference: a mathematical programming approach. Opns Res 24: 842-856.