IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v44y2012i8p655-670.html
   My bibliography  Save this article

A sample average approximation approach to stochastic appointment sequencing and scheduling

Author

Listed:
  • Camilo Mancilla
  • Robert Storer

Abstract

This article develops algorithms for a single-resource stochastic appointment sequencing and scheduling problem with waiting time, idle time, and overtime costs. This is a basic stochastic scheduling problem that has been studied in various forms by several previous authors. Applications for this problem cited previously include scheduling of surgeries in an operating room, scheduling of appointments in a clinic, scheduling ships in a port, and scheduling exams in an examination facility. In this article, the problem is formulated as a stochastic integer program using a sample average approximation. A heuristic solution approach based on Benders’ decomposition is developed and compared to exact methods and to previously proposed approaches. Extensive computational testing shows that the proposed methods produce good results compared with previous approaches. In addition, it is proved that the finite scenario sample average approximation problem is NP-complete.

Suggested Citation

  • Camilo Mancilla & Robert Storer, 2012. "A sample average approximation approach to stochastic appointment sequencing and scheduling," IISE Transactions, Taylor & Francis Journals, vol. 44(8), pages 655-670.
  • Handle: RePEc:taf:uiiexx:v:44:y:2012:i:8:p:655-670
    DOI: 10.1080/0740817X.2011.635174
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2011.635174
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0740817X.2011.635174?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:taf:uiiexx:v:44:y:2012:i:8:p:655-670. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.