Abstract
Four heuristic algorithms based on or inspired by the well-known Tabu Search method have been used to cast heuristically optimized schedules for a clinical training unit of a hospital. It has been found experimentally that the algorithm of choice for this problem depends on the exact goal being sought where the execution time is one of the components of the goal. If only one run is allowed, then classical Tabu Search with a tenure of 5 gave the schedule with the lowest average (and fixed) penalty. If time is not of concern and many runs are allowed then the Great Deluge algorithm may generate the schedule with the lowest penalty.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alfares, K.: Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research 127, 145–175 (2004)
Baker, K.: Workforce allocation in cyclic scheduling problems. Operations Research Quarterly 27, 155–167 (1976)
Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 262–275. Springer, Heidelberg (2003)
Dueck, G.: New optimization algorithms. Journal of Computational Physics 104, 86–92 (1993)
Ernst, A., Jiang, H., Krishnamuoorty, M., Dier, D.: Staff scheduling and rostering: a review of applications, methods and modelling. European Journal of Operational Research 153, 3–27 (2004)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
Glover, F., McMillan, C.: The general employee scheduling problem: an integration of management science and artificial intelligence. Computers and Operations Research 13, 563–593 (1986)
Neveu, B., Trombettoni, G., Glover, F.: Idwalk: A Candidate List Strategy With a Simple Diversification Device. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 423–437. Springer, Heidelberg (2004)
White, C.A., White, G.M.: Scheduling Doctors For Clinical Training Unit Rounds Using Tabu Optimization. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol. 2740, pp. 120–128. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
White, C.A., Nano, E., Nguyen-Ngoc, DH., White, G.M. (2007). An Evaluation of Certain Heuristic Optimization Algorithms in Scheduling Medical Doctors and Medical Students. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)