Predictive-reactive scheduling for single surgical suite subject to random emergency surgery

Bing Wang (), Xingbao Han (), Xianxia Zhang () and Shaohua Zhang ()
Additional contact information
Bing Wang: Shanghai University
Xingbao Han: Shanghai University
Xianxia Zhang: Shanghai University
Shaohua Zhang: Shanghai University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 9, 949-966

Abstract: Abstract This paper discusses the surgery scheduling problem for single surgical suite subject to random emergency surgery. In a surgical suite, each patient should be treated by three stages in the same order. This problem can be handled as a no-wait permutation flow-shop scheduling problem with three machines. A predictive-reactive scheduling approach is developed to accommodate the influence of surgery’s arrival on planned schedule while optimizing the objective of combining efficiency and stability. In the predictive scheduling phase, an initial schedule is generated by solely optimizing the efficiency, and then slack time is inserted in the initial schedule to generate a planned schedule based on the occurrence probability of emergency surgery. In the reactive scheduling phase, a “break-in-moment” of emergency surgery is determined to satisfy the requirement of non-preemption surgery and the no-wait constraint. A partial-rescheduling approach is used to revise the schedule of unperformed surgeries after an emergency surgery certainly breaks in the planned schedule. A computational experiment was conducted and the computational results demonstrate that comparing with traditional approaches, the predictive-reactive scheduling approach developed here could significantly improve the stability with a little sacrifice in the efficiency for all tested instances.

Keywords: Surgery scheduling problem; Efficiency and stability; Emergency surgery; Predictive-reactive scheduling; Partial rescheduling (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9861-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-015-9861-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9861-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().