Advertisement

Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization

  • Christine A. White
  • George M. White
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)

Abstract

Hospitals must be staffed 24 hours a day, seven days a week by teams of doctors having certain combinations of skills. The construction of schedules for these doctors and the medical students who work with them is known to be a difficult NP-complete problem known as personnel scheduling, employee timetabling, labour scheduling or rostering. We have constructed a program that uses a constraint logic formalism to enforce certain scheduling rules followed by a tabu search heuristic optimizing algorithm to produce a call schedule that is used at the Ottawa Hospital. This call schedule can be later changed by the chief resident to accommodate last-minute personnel changes by means of a spreadsheet-based program.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdennadher, S., Schlenker, H.: Interdip – an Interactive Constraint Based Nurse Scheduler. In: Proc. Int. Conf. Practical Applic. Constraint Technol. Logic Program, PACLP 1999 (1999)Google Scholar
  2. 2.
    Abdennadher, S., Schlenker, H.: Nurse Scheduling Using Constraint Logic Programming. In: Proc. 11th Annu. Conf. Innov. Applic. Artif. Intell. (1999)Google Scholar
  3. 3.
    De Causmaecker, P., Vanden Berghe, G.: Relaxation of Coverage Constraints in Hospital Personnel Rostering. In: Proc. 4th Int. Conf. Pract. Theory Timetabling, Gent, Belgium, August 21–23, pp. 187–206 (2002)Google Scholar
  4. 4.
    Cowling, P., Kendall, G., Soubeiga, E.: A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176–190. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Carter, M.W., Lapierre, S.: Scheduling Emergency Room Physicians. In: INFORMS Fall 1996 Meeting (1996) (publication 99–23)Google Scholar
  6. 6.
    Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: A Nurse Rostering System Using Constraint Programming and Redundant Modeling. IEEE Trans. Inf. Technol. Biomed. 1, 44–54 (1997)CrossRefGoogle Scholar
  7. 7.
    Costa, G.: The Impact of Shift and Night Work on Health. Appl. Ergonomics 27, 9–16 (1996)CrossRefGoogle Scholar
  8. 8.
    Chan, P., Weil, G.: Cyclical Staff Scheduling Using Constraint Logic Programming. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 159–175. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetables. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 104–117. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Franses, P., Post, G.: Personnel Scheduling in Laboratories Using IPs. In: Proc. 4th Int. Conf. Pract. Theory Timetabling, Gent, Belgium, August 21–23, pp. 175–178 (2002)Google Scholar
  11. 11.
    Gabow, H.N., Kohno, T.: A Network-Flow-Based Scheduler: Design, Performance History and Experimental Analysis. In: ALENEX – Algorithm Engineering and Experiments, January 7–8 (2000)Google Scholar
  12. 12.
    Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)zbMATHGoogle Scholar
  13. 13.
    Jan, A., Yamamoto, M., Ohuchi A.: Evolutionary Algorithms for Nurse Scheduling Problem. In: 2000 Congress Evolut. Comput. (2000) Google Scholar
  14. 14.
    Knauth, P.: The Design of Shift Systems. Ergonomics 36, 15–28 (1993)CrossRefGoogle Scholar
  15. 15.
    Knauth, P.: Design Better Shift Systems. Appl. Ergonomics 27, 39–44 (1996)CrossRefGoogle Scholar
  16. 16.
    Kragelund, L.V.: Solving a Timetable Problem Using Hybrid Genetic Algorithms. Softw. Practice and Experience 27, 1121–1134 (1996)CrossRefGoogle Scholar
  17. 17.
    Meisels, A., Kaplansky, E.: Scheduling agents – Distributed Timetabling Problems (DisTTP). In: Proc. 4th Int. Conf. Pract. Theory Timetabling, Gent, Belgium, August 21–23, pp. 182–184 (2002)Google Scholar
  18. 18.
    Meyer auf’m Hofe, H.: Solving Rostering Tasks as Constraint Optimization. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 191–212. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  19. 19.
    Petrovic, S., Beddoe, G., Vanden Berghe, G.: Storing and Adapting Repair Experiences in Personnel Rostering. In: Proc. 4th Int. Conf. Pract. Theory Timetabling, Gent, Belgium, August 21–23, pp. 185–186 (2002)Google Scholar
  20. 20.
    White, G.M., Xie, B.S.: Examination Timetables and Tabu Search with Longer- Term Memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 85–103. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Christine A. White
    • 1
  • George M. White
    • 2
  1. 1.Department of Internal MedicineUniversity of OttawaOttawaCanada
  2. 2.School of Information Technology and EngineeringUniversity of OttawaOttawaCanada

Personalised recommendations