<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>6958</id>
    <completedYear/>
    <publishedYear>2018</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>420</pageFirst>
    <pageLast>435</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>271</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Robust Allocation of Operating Rooms: a Cutting Plane Approach to handle Lognormal Case Durations</title>
    <abstract language="eng">The problem of allocating operating rooms (OR) to surgical cases is a challenging task, involving both combinatorial aspects&#13;
and uncertainty handling. We formulate this problem as a parallel machines scheduling problem, in which job durations follow a lognormal distribution,&#13;
and a fixed assignment of jobs to machines must be computed.&#13;
We propose a cutting-plane approach to solve the robust counterpart of this optimization problem.&#13;
To this end, we develop an algorithm based on fixed-point iterations that identifies worst-case scenarios and generates cut inequalities.&#13;
The main result of this article uses Hilbert's projective geometry to prove the convergence of this procedure under mild conditions.&#13;
We also propose two exact solution methods for a similar problem, but with a polyhedral uncertainty set, for which&#13;
only approximation approaches were known. Our model can&#13;
be extended to balance the load over several planning periods in a rolling horizon.&#13;
We present extensive numerical experiments for instances based on real data from a major hospital in Berlin. In particular, we find that:&#13;
(i) our approach performs well compared to a previous model that ignored the distribution of case durations; &#13;
(ii) compared to an alternative stochastic programming approach, robust optimization yields solutions that are more robust against uncertainty, at a small price in terms of average cost;&#13;
(iii) the \emph{longest expected processing time first} (LEPT) heuristic performs well and efficiently protects against extreme scenarios, but only if a good prediction model for the durations is available.&#13;
Finally, we draw a number of managerial implications from these observations.</abstract>
    <parentTitle language="eng">European Journal of Operational Research</parentTitle>
    <identifier type="doi">10.1016/j.ejor.2018.05.022</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-58502</enrichment>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Christoph Barner</author>
    <author>Ralf Borndörfer</author>
    <author>Mickaël Grima</author>
    <author>Mathes Seeling</author>
    <author>Claudia Spies</author>
    <author>Klaus Wernecke</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="Charité-OPOSSUM">Charité-OPOSSUM</collection>
    <collection role="projects" number="BMBF-IBOSS">BMBF-IBOSS</collection>
    <collection role="institutes" number="healthcare">Mathematics of Health Care</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
