Online appointment sequencing and scheduling

S. Ayca Erdogan, Alexander Gose and Brian T. Denton

IISE Transactions, 2015, vol. 47, issue 11, 1267-1286

Abstract: We formulate and solve a new stochastic integer programming model for dynamic sequencing and scheduling of appointments to a single stochastic server. We assume that service durations and the number of customers to be served on a particular day are uncertain. Customers are sequenced and scheduled dynamically (online) one at a time as they request appointments. We present a two-stage stochastic mixed integer program that uses a novel set of non-anticipativity constraints to capture the dynamic multi-stage nature of appointment requests as well as the sequencing of customers. We describe several ways to improve the computational efficiency of decomposition methods to solve our model. We also present some theoretical findings based on small problems to help motivate decision rules for larger problems. Our numerical experiments provide insights into optimal sequencing and scheduling decisions and the performance of the solution methods we propose.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2015.1011355 (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:47:y:2015:i:11:p:1267-1286

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

DOI: 10.1080/0740817X.2015.1011355

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