IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v61y2015i7p1584-1597.html
   My bibliography  Save this article

Optimal Advance Scheduling

Author

Listed:
  • Van-Anh Truong

    (Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027)

Abstract

The dynamic assignment of patients to exam days in order to manage daily variations in demand and capacity is a long-standing open research area in appointment scheduling. In particular, the dynamic assignment of advance appointments has been considered to be especially challenging because of its high dimensionality. We consider a canonical model of dynamic advance scheduling with two patient classes: an urgent demand class, which must be served on the day of arrival, and a regular demand class, which can be served at a future date. Patients take the earliest appointments offered and do not differentiate among providers. We derive a surprising characterization of an optimal policy and an algorithm to compute the policy exactly and efficiently. These are, to our knowledge, the first analytical results for the dynamic advance assignment of patients to exam days. We introduce the property of successive refinability, which allows advance schedules to be easily computable and under which there is no cost to the system to making advance commitments to patients. We allow multiple types of capacity to be considered and both demand and capacity to be nonstationary and stochastic. This paper was accepted by Martin Lariviere, operations management .

Suggested Citation

  • Van-Anh Truong, 2015. "Optimal Advance Scheduling," Management Science, INFORMS, vol. 61(7), pages 1584-1597, July.
    • Handle: RePEc:inm:ormnsc:v:61:y:2015:i:7:p:1584-1597
    DOI: 10.1287/mnsc.2014.2067
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2014.2067
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2014.2067?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
    ---><---

    References listed on IDEAS

    as
    1. Qing Ding & Panos Kouvelis & Joseph M. Milner, 2006. "Dynamic Pricing Through Discounts for Optimizing Multiple-Class Demand Fulfillment," Operations Research, INFORMS, vol. 54(1), pages 169-183, February.
    2. Santanu Chakraborty & Kumar Muthuraman & Mark Lawley, 2010. "Sequential clinical scheduling with patient no-shows and general service time distributions," IISE Transactions, Taylor & Francis Journals, vol. 42(5), pages 354-366.
    3. Jonathan Patrick & Martin L. Puterman & Maurice Queyranne, 2008. "Dynamic Multipriority Patient Scheduling for a Diagnostic Resource," Operations Research, INFORMS, vol. 56(6), pages 1507-1525, December.
    4. Jacob Feldman & Nan Liu & Huseyin Topaloglu & Serhan Ziya, 2014. "Appointment Scheduling Under Patient Preference and No-Show Behavior," Operations Research, INFORMS, vol. 62(4), pages 794-811, August.
    5. Donald M. Topkis, 1968. "Optimal Ordering and Rationing Policies in a Nonstationary Dynamic Inventory Model with n Demand Classes," Management Science, INFORMS, vol. 15(3), pages 160-176, November.
    6. Constantinos Maglaras & Assaf Zeevi, 2005. "Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights," Operations Research, INFORMS, vol. 53(2), pages 242-262, April.
    7. Yigal Gerchak & Diwakar Gupta & Mordechai Henig, 1996. "Reservation Planning for Elective Surgery Under Uncertain Demand for Emergency Surgery," Management Science, INFORMS, vol. 42(3), pages 321-334, March.
    8. Jonathan Patrick, 2012. "A Markov decision model for determining optimal outpatient scheduling," Health Care Management Science, Springer, vol. 15(2), pages 91-102, June.
    9. Rohleder, Thomas R. & Klassen, Kenneth J., 2000. "Using client-variance information to improve dynamic appointment scheduling performance," Omega, Elsevier, vol. 28(3), pages 293-302, June.
    10. Refael Hassin & Sharon Mendel, 2008. "Scheduling Arrivals to Queues: A Single-Server Model with No-Shows," Management Science, INFORMS, vol. 54(3), pages 565-572, March.
    11. Linda V. Green & Sergei Savin, 2008. "Reducing Delays for Medical Appointments: A Queueing Approach," Operations Research, INFORMS, vol. 56(6), pages 1526-1538, December.
    12. Wang, P. Patrick, 1999. "Sequencing and scheduling N customers for a stochastic server," European Journal of Operational Research, Elsevier, vol. 119(3), pages 729-738, December.
    13. Guido Kaandorp & Ger Koole, 2007. "Optimal outpatient appointment scheduling," Health Care Management Science, Springer, vol. 10(3), pages 217-229, September.
    14. Scott Carr & Izak Duenyas, 2000. "Optimal Admission Control and Sequencing in a Make-to-Stock/Make-to-Order Production System," Operations Research, INFORMS, vol. 48(5), pages 709-720, October.
    15. Albert Y. Ha, 1997. "Inventory Rationing in a Make-to-Stock Production System with Several Demand Classes and Lost Sales," Management Science, INFORMS, vol. 43(8), pages 1093-1103, August.
    16. Matthew J. Sobel & Rachel Q. Zhang, 2001. "Inventory Policies for Systems with Stochastic and Deterministic Demand," Operations Research, INFORMS, vol. 49(1), pages 157-162, February.
    17. Bo Zeng & Ayten Turkcan & Ji Lin & Mark Lawley, 2010. "Clinic scheduling models with overbooking for patients with heterogeneous no-show probabilities," Annals of Operations Research, Springer, vol. 178(1), pages 121-144, July.
    18. Qu, Xiuli & Rardin, Ronald L. & Williams, Julie Ann S. & Willis, Deanna R., 2007. "Matching daily healthcare provider capacity to demand in advanced access scheduling systems," European Journal of Operational Research, Elsevier, vol. 183(2), pages 812-826, December.
    19. Nan Liu & Serhan Ziya, 2014. "Panel Size and Overbooking Decisions for Appointment-Based Services under Patient No-Shows," Production and Operations Management, Production and Operations Management Society, vol. 23(12), pages 2209-2223, December.
    20. Lawrence W. Robinson & Rachel R. Chen, 2010. "A Comparison of Traditional and Open-Access Policies for Appointment Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 330-346, June.
    21. Linda V. Green & Sergei Savin & Ben Wang, 2006. "Managing Patient Service in a Diagnostic Medical Facility," Operations Research, INFORMS, vol. 54(1), pages 11-25, February.
    22. Albert Y. Ha, 1997. "Optimal Dynamic Scheduling Policy for a Make-To-Stock Production System," Operations Research, INFORMS, vol. 45(1), pages 42-53, February.
    23. Diwakar Gupta & Lei Wang, 2008. "Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice," Operations Research, INFORMS, vol. 56(3), pages 576-592, June.
    24. Woonghee Tim Huh & Nan Liu & Van-Anh Truong, 2013. "Multiresource Allocation Scheduling in Dynamic Environments," Manufacturing & Service Operations Management, INFORMS, vol. 15(2), pages 280-291, May.
    25. Alexander Erdelyi & Huseyin Topaloglu, 2009. "Computing protection level policies for dynamic capacity allocation problems by using stochastic approximation methods," IISE Transactions, Taylor & Francis Journals, vol. 41(6), pages 498-510.
    26. Jianzhe Luo & Vidyadhar G. Kulkarni & Serhan Ziya, 2012. "Appointment Scheduling Under Patient No-Shows and Service Interruptions," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 670-684, October.
    27. Nan Liu & Serhan Ziya & Vidyadhar G. Kulkarni, 2010. "Dynamic Scheduling of Outpatient Appointments Under Patient No-Shows and Cancellations," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 347-364, September.
    28. Augustine O. Esogbue & Amar J. Singh, 1976. "A Stochastic Model for an Optimal Priority Bed Distribution Problem in a Hospital Ward," Operations Research, INFORMS, vol. 24(5), pages 884-898, October.
    29. Mullen, Penelope M., 2003. "Prioritising waiting lists: how and why?," European Journal of Operational Research, Elsevier, vol. 150(1), pages 32-45, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. "Outpatient appointment systems in healthcare: A review of optimization studies," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.
    2. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    3. Li Luo & Ying Zhou & Bernard T. Han & Jialing Li, 2019. "An optimization model to determine appointment scheduling window for an outpatient clinic with patient no-shows," Health Care Management Science, Springer, vol. 22(1), pages 68-84, March.
    4. Miao Bai & Bjorn Berg & Esra Sisikoglu Sir & Mustafa Y. Sir, 2023. "Partially partitioned templating strategies for outpatient specialty practices," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 301-318, January.
    5. Paola Cappanera & Filippo Visintin & Carlo Banditori & Daniele Feo, 2019. "Evaluating the long-term effects of appointment scheduling policies in a magnetic resonance imaging setting," Flexible Services and Manufacturing Journal, Springer, vol. 31(1), pages 212-254, March.
    6. Dogru, Ali K. & Melouk, Sharif H., 2019. "Adaptive appointment scheduling for patient-centered medical homes," Omega, Elsevier, vol. 85(C), pages 166-181.
    7. Wen-Ya Wang & Diwakar Gupta, 2011. "Adaptive Appointment Systems with Patient Preferences," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
    8. Katsumi Morikawa & Katsuhiko Takahashi & Daisuke Hirotani, 2018. "Performance evaluation of candidate appointment schedules using clearing functions," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 509-518, March.
    9. Jiang, Yangzi & Abouee-Mehrizi, Hossein & Diao, Yuhe, 2020. "Data-driven analytics to support scheduling of multi-priority multi-class patients with wait time targets," European Journal of Operational Research, Elsevier, vol. 281(3), pages 597-611.
    10. Dongyang Wang & Kumar Muthuraman & Douglas Morrice, 2019. "Coordinated Patient Appointment Scheduling for a Multistation Healthcare Network," Operations Research, INFORMS, vol. 67(3), pages 599-618, May.
    11. Hans-Jörg Schütz & Rainer Kolisch, 2013. "Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service," Annals of Operations Research, Springer, vol. 206(1), pages 401-423, July.
    12. Jianzhe Luo & Vidyadhar G. Kulkarni & Serhan Ziya, 2012. "Appointment Scheduling Under Patient No-Shows and Service Interruptions," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 670-684, October.
    13. Christos Zacharias & Michael Pinedo, 2017. "Managing Customer Arrivals in Service Systems with Multiple Identical Servers," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 639-656, October.
    14. Oualid Jouini & Saif Benjaafar & Bingnan Lu & Siqiao Li & Benjamin Legros, 2022. "Appointment-driven queueing systems with non-punctual customers," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 1-56, June.
    15. Song-Hee Kim & Ward Whitt & Won Chul Cha, 2018. "A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 181-199, February.
    16. Yu Zhang & Vidyadhar G. Kulkarni, 2017. "Two-day appointment scheduling with patient preferences and geometric arrivals," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 173-209, February.
    17. Navid Izady, 2015. "Appointment Capacity Planning in Specialty Clinics: A Queueing Approach," Operations Research, INFORMS, vol. 63(4), pages 916-930, August.
    18. Schütz, Hans-Jörg & Kolisch, Rainer, 2012. "Approximate dynamic programming for capacity allocation in the service industry," European Journal of Operational Research, Elsevier, vol. 218(1), pages 239-250.
    19. Yu Fu & Amarnath Banerjee, 2021. "A Stochastic Programming Model for Service Scheduling with Uncertain Demand: an Application in Open-Access Clinic Scheduling," SN Operations Research Forum, Springer, vol. 2(3), pages 1-32, September.
    20. Jacob Feldman & Nan Liu & Huseyin Topaloglu & Serhan Ziya, 2014. "Appointment Scheduling Under Patient Preference and No-Show Behavior," Operations Research, INFORMS, vol. 62(4), pages 794-811, August.

    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:inm:ormnsc:v:61:y:2015:i:7:p:1584-1597. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.