IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p1048-1081.html

Strong Embeddings for Transitory Queueing Models

Author

Listed:
  • Prakash Chakraborty

    (Department of Statistics, Purdue University, West Lafayette, Indiana 47906)

  • Harsha Honnappa

    (School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47906)

Abstract

In this paper, we establish strong embedding theorems, in the sense of the Komlós-Major-Tusnády framework, for the performance metrics of a general class of transitory queueing models of nonstationary queueing systems. The nonstationary and non-Markovian nature of these models makes the computation of performance metrics hard. The strong embeddings yield error bounds on sample path approximations by diffusion processes in the form of functional strong approximation theorems.

Suggested Citation

  • Prakash Chakraborty & Harsha Honnappa, 2022. "Strong Embeddings for Transitory Queueing Models," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1048-1081, May.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:1048-1081
    DOI: 10.1287/moor.2021.1158
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1158
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1158?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. Gianmarco Bet & Remco van der Hofstad & Johan S. H. van Leeuwaarden, 2019. "Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 821-864, August.
    2. Song-Hee Kim & Ward Whitt & Won Chul Cha, 2018. "A Data-Driven Model of an Appointment-Generated Arrival Process at an Outpatient Clinic," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 181-199, February.
    3. Glazer, Amihai & Hassin, Refael, 1983. "?/M/1: On the equilibrium distribution of customer arrivals," European Journal of Operational Research, Elsevier, vol. 13(2), pages 146-150, June.
    4. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    5. Mor Armony & Rami Atar & Harsha Honnappa, 2019. "Asymptotically Optimal Appointment Schedules," Management Science, INFORMS, vol. 44(4), pages 1345-1380, November.
    6. Louchard, G., 1994. "Large finite population queueing systems. The single-server model," Stochastic Processes and their Applications, Elsevier, vol. 53(1), pages 117-145, September.
    7. Harsha Honnappa & Rahul Jain, 2015. "Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game," Operations Research, INFORMS, vol. 63(1), pages 247-259, February.
    8. Avi Mandelbaum & William A. Massey, 1995. "Strong Approximations for Time-Dependent Queues," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 33-64, February.
    9. 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.
    10. Horváth, Lajos, 1984. "Strong approximation of renewal processes," Stochastic Processes and their Applications, Elsevier, vol. 18(1), pages 127-138, September.
    11. Linda V. Green & Sergei Savin, 2008. "Reducing Delays for Medical Appointments: A Queueing Approach," Operations Research, INFORMS, vol. 56(6), pages 1526-1538, December.
    Full references (including those not matched with items on IDEAS)

    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. Gianmarco Bet & Remco van der Hofstad & Johan S. H. van Leeuwaarden, 2019. "Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 821-864, August.
    2. Moshe Haviv & Liron Ravner, 2021. "A survey of queueing systems with strategic timing of arrivals," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 163-198, October.
    3. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    4. Oualid Jouini & Saif Benjaafar & Bingnan Lu & Siqiao Li & Benjamin Legros, 2022. "Appointment-driven queueing systems with non-punctual customers," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 1-56, June.
    5. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    6. Wen-Ya Wang & Diwakar Gupta, 2011. "Adaptive Appointment Systems with Patient Preferences," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 373-389, July.
    7. 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.
    8. Li Luo & Ying Zhou & Bernard T. Han & Jialing Li, 2019. "An optimization model to determine appointment scheduling window for an outpatient clinic with patient no-shows," Health Care Management Science, Springer, vol. 22(1), pages 68-84, March.
    9. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    10. 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.
    11. Tunçalp, Feray & Güneş, Evrim D. & Örmeci, E. Lerzan, 2024. "Modeling strategic walk-in patients in appointment systems: Equilibrium behavior and capacity allocation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 587-601.
    12. Kazim Topuz & Timothy L. Urban & Robert A. Russell & Mehmet B. Yildirim, 2024. "Decision support system for appointment scheduling and overbooking under patient no-show behavior," Annals of Operations Research, Springer, vol. 342(1), pages 845-873, November.
    13. Yu Zhang & Vidyadhar G. Kulkarni, 2017. "Two-day appointment scheduling with patient preferences and geometric arrivals," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 173-209, February.
    14. Moshe Haviv & Liron Ravner, 2014. "Strategic timing of arrivals to a finite queue multi-server loss system," Discussion Paper Series dp675, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    15. Navid Izady, 2015. "Appointment Capacity Planning in Specialty Clinics: A Queueing Approach," Operations Research, INFORMS, vol. 63(4), pages 916-930, August.
    16. 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.
    17. Jiang, Bowen & Tang, Jiafu & Yan, Chongjun, 2019. "A stochastic programming model for outpatient appointment scheduling considering unpunctuality," Omega, Elsevier, vol. 82(C), pages 70-82.
    18. Christos Zacharias & Nan Liu & Mehmet A. Begen, 2024. "Dynamic Interday and Intraday Scheduling," Operations Research, INFORMS, vol. 72(1), pages 317-335, January.
    19. 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).
    20. Thu Nguyen & Appa Sivakumar & Stephen Graves, 2015. "A network flow approach for tactical resource planning in outpatient clinics," Health Care Management Science, Springer, vol. 18(2), pages 124-136, June.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:47:y:2022:i:2:p:1048-1081. 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: 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.