Solving a nurse scheduling problem with knapsacks, networks and tabu search

Journal of the Operational Research Society

Volumn 51, Issue 7, 2000, Pages 825-833

  Dowsland, K A ^a   Thompson, J M ^b  

^a SWANSEA UNIVERSITY   (United Kingdom)

^b CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Health; Integer programming; Manpower scheduling; Tabu search

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC PROGRAMMING; HOSPITALS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPERATIONS RESEARCH; SCHEDULING;

MANPOWER SCHEDULING; NETWORK FLOW MODELS; NURSE ROSTERING PROBLEMS; TABU SEARCH;

NURSING;

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

References (16)

1. Aykin T (1998). A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows. J Opl Res Soc 46: 698-707.
2. Mitra G, Darby-Dowman K, Lucas C and Smith JW (1995). Maritime scheduling and artificial intelligence techniques. In: Sciomachen A (ed). Optimization in Industry 3. Wiley: Chiche¬ster, pp l-17.
3. Easton F and Mansour N (1993). A distributed genetic algo¬rithm for employee staffing and scheduling problems. In: Schaffer JD (ed). Proceedings of the Fifth International Confer-ence on Genetic Algorithms. Morgan Kaufmann: Illinois, pp 360-367.
4. Brusco MJ and Jacobs LW (1993). A simulated annealing approach to the solution of flexible labour scheduling problems. J Opl Res Soc 44: 1191-1200.
5. Ferland JA (1998). Generalised assignment type problems: A powerful modelling scheme. In: Burke E and Carter M (eds). Practice and Theory of Automated Timetabling II, Lecture Notes in Computer Science 1408, Springer Verlag: Berlin, pp 53-77.
6. Dowsland KA (1998). Nurse scheduling with tabu search and strategic oscillation. Eur J Opl Res 106: 393-407.
7. Thompson JM and Dowsland KA (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Opns Res 63: 105-128.
8. Thompson JM and Dowsland KA (1998). A robust simulated annealing based examination timetabling system. Comps and Opns Res 25: 637-648.
9. Dige P, Lund C and Ravn HF (1993). Timetabling by simulated annealing. In: Vidal RVV (ed). Applied Simulated Annealing-Lecture Notes in Economics and Mathematical Systems, 396, Springer Verlag: Berlin, pp 151-174.
10. Hertz A (1991). Tabu search for large scale timetabling problems. Eur J Opl Res 54: 39-47.
11. Wright M (1996). School timetabling using heuristic search. J Opl Res Soc 47: 347-357.
12. Wright M (1994). Timetabling county cricket fixtures using a form of tabu search. J Opl Res Soc 45: 758-770.
13. Costa D (1995). An evolutionary tabu search algorithm and the NHL scheduling problem INFOR 33: 161-178.
14. Glover F and Laguna M (1997). Tabu Search. Kluwer: Boston.
15. Martello S and Toth P (1990). Knapsack Problems. Wiley: Chichester.
16. Smith DK (1982). Network Optimisation Practice. Ellis Horwood: Chichester.