Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • Matias Holte

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

  • Carlo Mannino

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

Registered author(s):

    Abstract

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/2011-03.pdf
    Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Antonietta Angelica Zucconi)
    File Function: First version 2011
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza" in its series DIS Technical Reports with number 2011-03.

    as in new window
    Length:
    Date of creation: 2011
    Date of revision:
    Handle: RePEc:aeg:wpaper:2011-3

    Contact details of provider:
    Phone: +390677274140
    Fax: +39 0677274129
    Email:
    Web page: http://www.dis.uniroma1.it
    More information through EDIRC

    Related research

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

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    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.
    4. Manishi Prasad & Peter Wahlqvist & Rich Shikiar & Ya-Chen Tina Shih, 2004. "A," PharmacoEconomics, Springer Healthcare | Adis, vol. 22(4), pages 225-244.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    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).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.