Prioritized surgery scheduling in face of surgeon tiredness and fixed off-duty period
Dujuan Wang (),
Feng Liu (),
Yunqiang Yin (),
Jianjun Wang () and
Yanzhang Wang ()
Additional contact information
Dujuan Wang: Dalian University of Technology
Feng Liu: Dongbei University of Finance and Economics
Yunqiang Yin: Kunming University of Science and Technology
Jianjun Wang: Dalian University of Technology
Yanzhang Wang: Dalian University of Technology
Journal of Combinatorial Optimization, 2015, vol. 30, issue 4, No 10, 967-981
Abstract:
Abstract In this paper, we apply a scheduling model to address the single day surgery scheduling problem for single operating room (OR). The OR operational cost and patients’ satisfaction need to be balanced. We optimize the scheduling of surgeries with two priority levels in an integrated manner, given the OR is off-duty for a fixed period. Surgeon’s accumulated tiredness during working hours, and controllable surgery durations are modeled. After deriving the NP-hardness of the problem, we first solve optimally two special cases in pseudo-polynomial time, and then design a hybrid evolutionary multi-objective algorithm for the general case. Iterated local search is embedded into the elitist non-dominated sorting genetic algorithm (NSGA-II) framework, and Pareto optimal property is utilized to guide evolution towards promising areas in solution space. Finally computational studies with data from a hospital in P.R. China are performed to verify the value of algorithm hybridization against the commercial solver and original NSGA-II, and to verify the value of integrated optimization against sequential decision-making.
Keywords: Surgery scheduling; Surgeon tiredness; Controllable duration; Hybridized meta-heuristic; Pareto front (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9846-1 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-9846-1
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-015-9846-1
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 ().