IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v30y2018i1d10.1007_s10696-016-9270-6.html
   My bibliography  Save this article

Developing an optimal appointment scheduling for systems with rigid standby time under pre-determined quality of service

Author

Listed:
  • Illana Bendavid

    (ORT Braude College of Engineering)

  • Yariv N. Marmor

    (ORT Braude College of Engineering)

  • Boris Shnits

    (ORT Braude College of Engineering)

Abstract

A critical step in patient care path is diagnosis. The demand for advanced imaging tests, such as computerized axial tomography, magnetic resonance imaging and positron emission tomography (PET), increased dramatically in the past 15 years. Since imaging equipment remains relatively expensive, in order to fit the demand, the imaging resources must be managed effectively while ensuring required quality of service. In PET, a radiopharmaceutical (radioactive substance) is injected to patients prior to their scans. The time between substance injection and scan (standby or uptake time) is rigid. This constraint makes the patient appointment scheduling more challenging, because if at the end of the expected uptake time the scanner is not available, the quality of the scan is jeopardized (due to short half-life duration of the substance). The availability of the scanner is a consequence of prior scans’ appointments and durations. The aim of this work is to develop an approach for appointment scheduling in a system with one scanner, given a sequence of patients and rigid uptake time, in order to minimize the length of day while satisfying a minimal pre-determined quality of service. In order to solve this stochastic problem, we formulate its equivalent deterministic problem, based on simulated data, as a mixed-integer linear programming. To overcome the dimensionality limitations, we develop a simulation-based sequential algorithm that solves the problem in a reasonable time. We found that a fixed slot per scan policy, as a benchmark, is inferior to our method, especially in achieving stable and fair quality of service for patients.

Suggested Citation

  • Illana Bendavid & Yariv N. Marmor & Boris Shnits, 2018. "Developing an optimal appointment scheduling for systems with rigid standby time under pre-determined quality of service," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 54-77, June.
    • Handle: RePEc:spr:flsman:v:30:y:2018:i:1:d:10.1007_s10696-016-9270-6
    DOI: 10.1007/s10696-016-9270-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-016-9270-6
    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/s10696-016-9270-6?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. Illana Bendavid & Boaz Golany, 2009. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 172(1), pages 259-276, November.
    2. Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
    3. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    4. Federico Sabria & Carlos F. Daganzo, 1989. "Approximate Expressions for Queueing Systems with Scheduled Arrivals and Established Service Order," Transportation Science, INFORMS, vol. 23(3), pages 159-165, August.
    5. Sujin Kim & Raghu Pasupathy & Shane G. Henderson, 2015. "A Guide to Sample Average Approximation," International Series in Operations Research & Management Science, in: Michael C Fu (ed.), Handbook of Simulation Optimization, edition 127, chapter 0, pages 207-243, Springer.
    6. P. Patrick Wang, 1993. "Static and dynamic scheduling of customer arrivals to a single‐server system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 345-360, April.
    7. Illana Bendavid & Boaz Golany, 2011. "Predetermined intervals for start times of activities in the stochastic project scheduling problem," Annals of Operations Research, Springer, vol. 186(1), pages 429-442, June.
    8. Candace Arai Yano, 1987. "Setting Planned Leadtimes in Serial Production Systems with Tardiness Costs," Management Science, INFORMS, vol. 33(1), pages 95-106, January.
    9. Elmaghraby, Salah E., 2001. "On the optimal release time of jobs with random processing times, with extensions to other criteria," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 103-113, December.
    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. Yong-Hong Kuo & Hari Balasubramanian & Yan Chen, 2020. "Medical appointment overbooking and optimal scheduling: tradeoffs between schedule efficiency and accessibility to service," Flexible Services and Manufacturing Journal, Springer, vol. 32(1), pages 72-101, March.
    2. Shnits, Boris & Bendavid, Illana & Marmor, Yariv N., 2020. "An appointment scheduling policy for healthcare systems with parallel servers and pre-determined quality of service," Omega, Elsevier, vol. 97(C).
    3. Carolin Bauerhenne & Rainer Kolisch & Andreas S. Schulz, 2024. "Robust Appointment Scheduling with Waiting Time Guarantees," Papers 2402.12561, arXiv.org.
    4. Zhou, Shenghai & Li, Debiao & Yin, Yong, 2021. "Coordinated appointment scheduling with multiple providers and patient-and-physician matching cost in specialty care," Omega, Elsevier, vol. 101(C).

    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. Shnits, Boris & Bendavid, Illana & Marmor, Yariv N., 2020. "An appointment scheduling policy for healthcare systems with parallel servers and pre-determined quality of service," Omega, Elsevier, vol. 97(C).
    2. Yifei Sun & Usha Nandini Raghavan & Vikrant Vaze & Christopher S Hall & Patricia Doyle & Stacey Sullivan Richard & Christoph Wald, 2021. "Stochastic programming for outpatient scheduling with flexible inpatient exam accommodation," Health Care Management Science, Springer, vol. 24(3), pages 460-481, September.
    3. 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.
    4. Song, Dong-Ping, 2006. "Raw material release time control for complex make-to-order products with stochastic processing times," International Journal of Production Economics, Elsevier, vol. 103(1), pages 371-385, September.
    5. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2014. "Sequencing Appointments for Service Systems Using Inventory Approximations," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 251-262, May.
    6. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    7. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    8. Illana Bendavid & Boaz Golany, 2011. "Predetermined intervals for start times of activities in the stochastic project scheduling problem," Annals of Operations Research, Springer, vol. 186(1), pages 429-442, June.
    9. 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.
    10. Mehmet A. Begen & Retsef Levi & Maurice Queyranne, 2012. "Technical Note---A Sampling-Based Approach to Appointment Scheduling," Operations Research, INFORMS, vol. 60(3), pages 675-681, June.
    11. Creemers, Stefan & Lambrecht, Marc R. & Beliën, Jeroen & Van den Broeke, Maud, 2021. "Evaluation of appointment scheduling rules: A multi-performance measurement approach," Omega, Elsevier, vol. 100(C).
    12. Marlin W. Ulmer & Barrett W. Thomas, 2019. "Enough Waiting for the Cable Guy—Estimating Arrival Times for Service Vehicle Routing," Transportation Science, INFORMS, vol. 53(3), pages 897-916, May.
    13. Illana Bendavid & Boaz Golany, 2009. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 172(1), pages 259-276, November.
    14. Arlen Dean & Amirhossein Meisami & Henry Lam & Mark P. Van Oyen & Christopher Stromblad & Nick Kastango, 2022. "Quantile regression forests for individualized surgery scheduling," Health Care Management Science, Springer, vol. 25(4), pages 682-709, December.
    15. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    16. Illana Bendavid & Boaz Golany, 2011. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 189(1), pages 25-42, September.
    17. Miao Bai & Robert H. Storer & Gregory L. Tonkay, 2022. "Surgery Sequencing Coordination with Recovery Resource Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1207-1223, March.
    18. 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.
    19. 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.
    20. 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.

    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:flsman:v:30:y:2018:i:1:d:10.1007_s10696-016-9270-6. 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: 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.