IDEAS home Printed from https://ideas.repec.org/a/inm/orserv/v6y2014i4p274-295.html
   My bibliography  Save this article

A Universal Appointment Rule with Patient Classification for Service Times, No-Shows, and Walk-Ins

Author

Listed:
  • Tugba Cayirli

    (School of Economics and Administrative Sciences, Özyeğin University, Istanbul, Turkey 34764)

  • Kum Khiong Yang

    (Lee Kong Chian School of Business, Singapore Management University, Singapore 178899)

Abstract

This study evaluates patient classification for scheduling and sequencing appointments for patients differentiated by their mean and standard deviation of service times, no-show, and walk-in probabilities. Alternative appointment systems are tested through simulation using a universal Dome rule and some of the best traditional appointment rules in the literature. Our findings show that the universal Dome rule performs better in terms of reducing the total cost of patient’s waiting time, doctor’s idle time, and overtime, and its performance improves further with the right sequencing of patient groups. Although it is a challenge to find the best sequence, we propose a heuristic rule that successfully identifies the best sequence with an accuracy level of 98% for the universal Dome rule. Sensitivity analyses further confirm that our findings are valid even when assumptions on patient punctuality and service time distributions are relaxed. To facilitate the use of our proposed appointment system, an open source online tool is developed to support practitioners in designing their appointment schedules for real clinics.

Suggested Citation

  • Tugba Cayirli & Kum Khiong Yang, 2014. "A Universal Appointment Rule with Patient Classification for Service Times, No-Shows, and Walk-Ins," Service Science, INFORMS, vol. 6(4), pages 274-295, December.
  • Handle: RePEc:inm:orserv:v:6:y:2014:i:4:p:274-295
    DOI: 10.1287/serv.2014.0087
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/serv.2014.0087
    Download Restriction: no

    File URL: https://libkey.io/10.1287/serv.2014.0087?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
    ---><---

    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:orserv:v:6:y:2014:i:4:p:274-295. 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 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.