Robust Allocation of Operating Rooms with Lognormal case Durations
Please always quote using this URN: urn:nbn:de:0297-zib-58497
- The problem of allocating operating rooms (OR) to surgical cases is a challenging task, involving both combinatorial aspects and uncertainty handling. In this article, we formulate this problem as a job shop scheduling problem, in which the job durations follow a lognormal distribution. We propose to use a cutting-plane approach to solve a robust version of this optimization problem. To this end, we develop an algorithm based on fixed-point iterations to solve the subproblems that identify worst-case scenarios and generate cut inequalities. The procedure is illustrated with numerical experiments based on real data from a major hospital in Berlin.
| Author: | Guillaume Sagnol, Ralf BorndörferORCiD, Mickaël Grima, Matthes Seeling, Claudia Spies |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | Hilbert's projective metric; lognormal duration; robust optimization |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] |
| Granting Institution: | Freie Universität Berlin |
| Publishing Institution: | Zuse Institute Berlin (ZIB) |
| Date of first Publication: | 2016/03/24 |
| Series (Serial Number): | ZIB-Report (16-16) |
| ISSN: | 1438-0064 |
| Published in: | Proceedings of the 15th International Conference on Project Management and Scheduling (PMS 2016), pp.52-55 |
| URL: | http://www.pms2016.com/congreso/ficha.en.html |
