A Set Packing Approach for Scheduling Elective Surgical Procedures

R. Velásquez () and M. T. Melo ()
Additional contact information
R. Velásquez: Fraunhofer Institute for Industrial Mathematics (ITWM)
M. T. Melo: Fraunhofer Institute for Industrial Mathematics (ITWM)

A chapter in Operations Research Proceedings 2005, 2006, pp 425-430 from Springer

Abstract: Summary The efficient scheduling of surgical procedures to operating rooms in a hospital is a complex problem due to limited resources (e.g. medical staff, equipment) and conflicting objectives (e.g. reduce running costs and increase staff and patient satisfaction). A novel approach for scheduling elective surgeries over a short-term horizon is proposed which takes explicit consideration of these aspects. The problem is formulated as a set packing problem and solved optimally through column generation and constraint branching. Good results were obtained for instances from the literature.

Keywords: Column Generation; Resource Combination; Operating Room Schedule; Mixed Integer Model; Crew Rostering (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_67

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_67

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().