IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v46y1999i5p549-559.html
   My bibliography  Save this article

Scheduling customer arrivals to a stochastic service system

Author

Listed:
  • Peter M. Vanden Bosch
  • Dennis C. Dietz
  • John R. Simeoni

Abstract

An efficient algorithm for determining the optimal arrival schedule for customers in a stochastic service system is developed. All customers arrive exactly when scheduled, and service times are modeled as iid Erlang random variables. Costs are incurred at a fixed rate per unit of time each customer waits for service, and an additional cost is incurred for every unit of time the server operates beyond a scheduled closing time. The objective is to minimize total operating cost. This type of problem arises in many operational contexts including transportation, manufacturing, and appointment‐based services. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 549–559, 1999

Suggested Citation

  • Peter M. Vanden Bosch & Dennis C. Dietz & John R. Simeoni, 1999. "Scheduling customer arrivals to a stochastic service system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 549-559, August.
    • Handle: RePEc:wly:navres:v:46:y:1999:i:5:p:549-559
    DOI: 10.1002/(SICI)1520-6750(199908)46:53.0.CO;2-Y
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1520-6750(199908)46:53.0.CO;2-Y
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1520-6750(199908)46:53.0.CO;2-Y?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. 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.
    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. 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).
    2. 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.
    3. Agnihothri, Saligrama & Cappanera, Paola & Nonato, Maddalena & Visintin, Filippo, 2024. "Appointment scheduling in surgery pre-admission testing clinics," Omega, Elsevier, vol. 123(C).
    4. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    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. 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.

    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. 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.
    2. Sakine Batun & Brian T. Denton & Todd R. Huschka & Andrew J. Schaefer, 2011. "Operating Room Pooling and Parallel Surgery Processing Under Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 220-237, May.
    3. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    13. 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).
    14. 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).
    15. 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.
    16. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    17. S. Ayca Erdogan & Brian Denton, 2013. "Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 116-132, February.
    18. Khaniyev, Taghi & Kayış, Enis & Güllü, Refik, 2020. "Next-day operating room scheduling with uncertain surgery durations: Exact analysis and heuristics," European Journal of Operational Research, Elsevier, vol. 286(1), pages 49-62.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:46:y:1999:i:5:p:549-559. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.