Minimax cth percentile of makespan in surgical scheduling

Vikas Agrawal, Aber Elsaleiby, Yue Zhang, P. S. Sundararaghavan and Andrew Casabianca

Health Systems, 2021, vol. 10, issue 2, 118-130

Abstract: In this paper, we address the problem of finding an assignment of n surgeries to be performed in one of m parallel identical operating rooms (ORs), given each surgery has a stochastic duration with a known mean and standard deviation. The objective is to minimise the maximum of the cth percentile of makespan of any OR. We formulate this problem as a nonlinear integer program, and small-sized instances are solved using the GAMS BONMIN solver. We develop a greedy heuristic and a genetic algorithm procedure for solving large-sized instances. Using real data from a major U.S. teaching hospital and benchmarking datasets from the literature, we report on the performance of the heuristics as compared to the GAMS BONMIN solver.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/20476965.2019.1700763 (text/html)
Access to full text is restricted to subscribers.

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:taf:thssxx:v:10:y:2021:i:2:p:118-130

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/thss20

DOI: 10.1080/20476965.2019.1700763

Access Statistics for this article

Health Systems is currently edited by Sally Brailsford

More articles in Health Systems from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().