A sample average approximation approach to stochastic appointment sequencing and scheduling

Camilo Mancilla and Robert Storer

IISE Transactions, 2012, vol. 44, issue 8, 655-670

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.

Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2011.635174 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:44:y:2012:i:8:p:655-670

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2011.635174

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().