IDEAS home Printed from
   My bibliography  Save this paper

The implementor/adversarial algorithm for cyclic and robust scheduling problems in health-care


  • Matias Holte

    () (SINTEF ICT, Norway Dept. of Applied Mathematics)

  • Carlo Mannino

    () (Dipartimento di Informatica e Sistemistica "Antonio Ruberti" Sapienza, Universita' di Roma)


A general problem in health-care consists in allocating some scarce medical resource, such as operating rooms or medical staff, to medical specialties in order to keep the queue of patients as short as possible. A major difficulty stems from the fact that such an allocation must be established several months in advance, whereas the exact number of patients for each specialty is an uncertain parameter. Another problem arises for cyclic schedules, where the allocation is defined over a short period, e.g. a week, and then repeated during the time horizon. Even if the demand is perfectly known in advance, the number of patients may vary from week to week. We model both the uncertain and the cyclic allocation problem as adjustable robust scheduling problems. We develop a row and column generation algorithm to solve this problem: this turns out to be the implementor/adversarial algorithm for robust optimization recently introduced by Bienstock for portfolio selection. We apply our general model to compute master surgery schedules for a real-life instance from a large hospital in Oslo.

Suggested Citation

  • Matias Holte & Carlo Mannino, 2011. "The implementor/adversarial algorithm for cyclic and robust scheduling problems in health-care," DIS Technical Reports 2011-03, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
  • Handle: RePEc:aeg:wpaper:2011-3

    Download full text from publisher

    File URL:
    File Function: First version 2011
    Download Restriction: no

    References listed on IDEAS

    1. Belien, Jeroen & Demeulemeester, Erik, 2007. "Building cyclic master surgery schedules with leveled resulting bed occupancy," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1185-1204, January.
    2. Cardoen, Brecht & Demeulemeester, Erik & Beliƫn, Jeroen, 2010. "Operating room planning and scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 201(3), pages 921-932, March.
    3. Hans, Erwin & Wullink, Gerhard & van Houdenhoven, Mark & Kazemier, Geert, 2008. "Robust surgery loading," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1038-1050, March.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Health-care optimization; Master surgery scheduling; Robust optimization; Mixed-integer programming;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aeg:wpaper:2011-3. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antonietta Angelica Zucconi). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.