Journal article
Scheduling patients in an ambulatory surgical center
Naval research logistics, Vol.50(3), pp.218-238
04/2003
DOI: 10.1002/nav.10060
Abstract
This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no-wait, two-stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search-based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc.
Details
- Title: Subtitle
- Scheduling patients in an ambulatory surgical center
- Creators
- Vernon Ning Hsu - George Mason UniversityRenato de Matta - University of IowaChung-Yee Lee - Hong Kong University of Science and Technology
- Resource Type
- Journal article
- Publication Details
- Naval research logistics, Vol.50(3), pp.218-238
- Publisher
- Wiley Subscription Services, Inc., A Wiley Company
- DOI
- 10.1002/nav.10060
- ISSN
- 0894-069X
- eISSN
- 1520-6750
- Number of pages
- 21
- Language
- English
- Date published
- 04/2003
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380406902771
Metrics
3 Record Views