Abstract
Among several decision making problems in running the surgical suite in a hospital efficiently, this chapter considers three most important ones: allocating available operating room times to various departments, fixing surgery dates to incoming patients, and sequencing the various surgeries to be performed by a surgeon over the time of a day. We describe the approaches adopted to solve them to find efficient solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Etzioni, D. A., Liu, J. H., Maggard, M. A., & Ko C. Y. (2003). The aging population and its impact on the surgery workforce. Annals of Surgery, 238(2), 170–177.
Kuo, P. C., Schroeder, R. A., & Mahaffey, S. (2003). Optimization of operating room allocation using linear programming techniques. Journal of the American College of Surgeons, 197(6), 889–895. (Elsevier Inc.).
Kildea, J. (1970). Operating room scheduling methods: The two room system. Hospitals, 44, 99–101.
AIMMS/MOPTA contest problem. (2013). See at the website http://www.aimms.com.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
1 Electronic supplementary material
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this chapter
Cite this chapter
Murty, K.G., Chen, W., Duck, M.G. (2015). Giving Appointments to Patients for Surgeries, and Scheduling Surgeries to Operating Rooms in a Day. In: Murty, K. (eds) Case Studies in Operations Research. International Series in Operations Research & Management Science, vol 212. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-1007-6_20
Download citation
DOI: https://doi.org/10.1007/978-1-4939-1007-6_20
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-1006-9
Online ISBN: 978-1-4939-1007-6
eBook Packages: Business and EconomicsBusiness and Management (R0)