IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v27y2024i2d10.1007_s10951-023-00802-9.html
   My bibliography  Save this article

A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients

Author

Listed:
  • Chao Li

    (Hunan University)

  • Zhi Yang

    (Hunan University)

  • Fajun Yang

    (Shanghai University
    Hagen University)

  • Feng Wang

    (Hunan University)

Abstract

No-shows and non-punctual appointments have always been uncertain factors faced by managers of service-oriented enterprises and institutions, which usually lead to a low utilization rate of resources and a rapid decline in service satisfaction. Taking clinics as an example, this paper proposes a novel and efficient real-time sequencing strategy to minimize the cost associated with patient waiting time, provider idle time and overtime considering no-shows and unpunctuality. Four types of patient waiting time are considered for the first time, based on which the developed real-time sequencing strategy is used for scheduling the waiting patients when the provider becomes idle. Then, a biased random-key genetic algorithm is adopted to determine the number of patients on appointment slots and the length of each appointment slot. Extensive computational experiments show that the derived real-time sequencing strategy achieves a significant cost reduction compared with the famous FCFS (first come first served) and the state-of-art LAR (the larger of appointment time and real arrival time) rules.

Suggested Citation

  • Chao Li & Zhi Yang & Fajun Yang & Feng Wang, 2024. "A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients," Journal of Scheduling, Springer, vol. 27(2), pages 135-149, April.
  • Handle: RePEc:spr:jsched:v:27:y:2024:i:2:d:10.1007_s10951-023-00802-9
    DOI: 10.1007/s10951-023-00802-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-023-00802-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10951-023-00802-9?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.

    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:spr:jsched:v:27:y:2024:i:2:d:10.1007_s10951-023-00802-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.