IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v240y2015i1p213-219.html
   My bibliography  Save this article

Optimal appointment scheduling in continuous time: The lag order approximation method

Author

Listed:
  • Vink, Wouter
  • Kuiper, Alex
  • Kemper, Benjamin
  • Bhulai, Sandjai

Abstract

We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within reasonable computation times. Therefore, we develop the lag order approximation method, that sets the client’s optimal appointment time based on only a part of his predecessors. We show that a lag order of two, i.e., taking two predecessors into account, results in nearly optimal schedules within reasonable computation times. We illustrate our approximation method with an appointment scheduling problem in a CT-scan area.

Suggested Citation

  • Vink, Wouter & Kuiper, Alex & Kemper, Benjamin & Bhulai, Sandjai, 2015. "Optimal appointment scheduling in continuous time: The lag order approximation method," European Journal of Operational Research, Elsevier, vol. 240(1), pages 213-219.
    • Handle: RePEc:eee:ejores:v:240:y:2015:i:1:p:213-219
    DOI: 10.1016/j.ejor.2014.06.024
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171400527X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.06.024?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.

    References listed on IDEAS

    as
    1. Turkcan, Ayten & Zeng, Bo & Muthuraman, Kumar & Lawley, Mark, 2011. "Sequential clinical scheduling with service criteria," European Journal of Operational Research, Elsevier, vol. 214(3), pages 780-795, November.
    2. Chrwan-Jyh Ho & Hon-Shiang Lau, 1992. "Minimizing Total Cost in Scheduling Outpatient Appointments," Management Science, INFORMS, vol. 38(12), pages 1750-1764, December.
    3. Kemper, Benjamin & Klaassen, Chris A.J. & Mandjes, Michel, 2014. "Optimized appointment scheduling," European Journal of Operational Research, Elsevier, vol. 239(1), pages 243-255.
    4. S. Creemers & J. Beliën & M. Lambrecht, 2012. "The optimal allocation of server time slots over different classes of customers," Post-Print hal-00800190, HAL.
    5. 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.
    6. 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.
    7. Guido Kaandorp & Ger Koole, 2007. "Optimal outpatient appointment scheduling," Health Care Management Science, Springer, vol. 10(3), pages 217-229, September.
    8. Brant E. Fries & Vijay P. Marathe, 1981. "Determination of Optimal Variable-Sized Multiple-Block Appointment Systems," Operations Research, INFORMS, vol. 29(2), pages 324-345, April.
    9. Creemers, Stefan & Beliën, Jeroen & Lambrecht, Marc, 2012. "The optimal allocation of server time slots over different classes of patients," European Journal of Operational Research, Elsevier, vol. 219(3), pages 508-521.
    10. Albert Schild & Irwin J. Fredman, 1961. "On Scheduling Tasks with Associated Linear Loss Functions," Management Science, INFORMS, vol. 7(3), pages 280-285, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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.

    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. De Vuyst, Stijn & Bruneel, Herwig & Fiems, Dieter, 2014. "Computationally efficient evaluation of appointment schedules in health care," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1142-1154.
    3. Kemper, Benjamin & Klaassen, Chris A.J. & Mandjes, Michel, 2014. "Optimized appointment scheduling," European Journal of Operational Research, Elsevier, vol. 239(1), pages 243-255.
    4. Wen-Ya Wang & Diwakar Gupta, 2011. "Adaptive Appointment Systems with Patient Preferences," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
    5. Tugba Cayirli & Kum Khiong Yang & Ser Aik Quek, 2012. "A Universal Appointment Rule in the Presence of No‐Shows and Walk‐Ins," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 682-697, July.
    6. 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.
    7. Kuiper, Alex & de Mast, Jeroen & Mandjes, Michel, 2021. "The problem of appointment scheduling in outpatient clinics: A multiple case study of clinical practice," Omega, Elsevier, vol. 98(C).
    8. 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.
    9. Pan, Xingwei & Geng, Na & Xie, Xiaolan & Wen, Jing, 2020. "Managing appointments with waiting time targets and random walk-ins," Omega, Elsevier, vol. 95(C).
    10. Shenghai Zhou & Yichuan Ding & Woonghee Tim Huh & Guohua Wan, 2021. "Constant Job‐Allowance Policies for Appointment Scheduling: Performance Bounds and Numerical Analysis," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2211-2231, July.
    11. 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.
    12. Shehadeh, Karmel S. & Cohn, Amy E.M. & Epelman, Marina A., 2019. "Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 721-731.
    13. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    14. Soltani, Mohamad & Samorani, Michele & Kolfal, Bora, 2019. "Appointment scheduling with multiple providers and stochastic service times," European Journal of Operational Research, Elsevier, vol. 277(2), pages 667-683.
    15. Qingxia Kong & Chung-Yee Lee & Chung-Piaw Teo & Zhichao Zheng, 2013. "Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones," Operations Research, INFORMS, vol. 61(3), pages 711-726, June.
    16. Thu-Ba T. Nguyen & Appa Iyer Sivakumar & Stephen C. Graves, 2017. "Scheduling rules to achieve lead-time targets in outpatient appointment systems," Health Care Management Science, Springer, vol. 20(4), pages 578-589, December.
    17. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    18. Van-Anh Truong, 2015. "Optimal Advance Scheduling," Management Science, INFORMS, vol. 61(7), pages 1584-1597, July.
    19. Morikawa, Katsumi & Takahashi, Katsuhiko, 2017. "Scheduling appointments for walk-ins," International Journal of Production Economics, Elsevier, vol. 190(C), pages 60-66.
    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.

    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:eee:ejores:v:240:y:2015:i:1:p:213-219. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.