IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v21y2019i4d10.1007_s11009-018-9683-7.html
   My bibliography  Save this article

The Single Server Queue with Mixing Dependencies

Author

Listed:
  • Youri Raaijmakers

    (Eindhoven University of Technology)

  • Hansjörg Albrecher

    (University of Lausanne
    Swiss Finance Institute)

  • Onno Boxma

    (Eindhoven University of Technology)

Abstract

We study a single server queue, where a certain type of dependence is introduced between the service times, or between the inter-arrival times, or both between the service times and the inter-arrival times. This dependence arises via mixing, i.e., a parameter pertaining to the distribution of the service times, or of the inter-arrival times, is itself considered to be a random variable. We give a duality result between such queueing models and the corresponding insurance risk models, for which the respective dependence structures have been studied before. For a number of examples we provide exact expressions for the waiting time distribution, and compare these to the ones for the standard M/M/1 queue. We also investigate the effect of dependence and derive first order asymptotics for some of the obtained waiting time tails. Finally, we discuss this dependence concept for the waiting time tail of the G/M/1 queue.

Suggested Citation

  • Youri Raaijmakers & Hansjörg Albrecher & Onno Boxma, 2019. "The Single Server Queue with Mixing Dependencies," Methodology and Computing in Applied Probability, Springer, vol. 21(4), pages 1023-1044, December.
    • Handle: RePEc:spr:metcap:v:21:y:2019:i:4:d:10.1007_s11009-018-9683-7
    DOI: 10.1007/s11009-018-9683-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-018-9683-7
    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/s11009-018-9683-7?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. Albrecher, Hansjörg & Constantinescu, Corina & Loisel, Stephane, 2011. "Explicit ruin formulas for models with dependence among risks," Insurance: Mathematics and Economics, Elsevier, vol. 48(2), pages 265-270, March.
    2. repec:hal:wpaper:hal-00746251 is not listed on IDEAS
    3. Dutang, C. & Lefèvre, C. & Loisel, S., 2013. "On an asymptotic rule A+B/u for ultimate ruin probabilities under dependence by mixing," Insurance: Mathematics and Economics, Elsevier, vol. 53(3), pages 774-785.
    4. Badila, E.S. & Boxma, O.J. & Resing, J.A.C., 2015. "Two parallel insurance lines with simultaneous arrivals and risks correlated with inter-arrival times," Insurance: Mathematics and Economics, Elsevier, vol. 61(C), pages 48-61.
    5. Song-Hee Kim & Ward Whitt, 2014. "Are Call Center and Hospital Arrivals Well Modeled by Nonhomogeneous Poisson Processes?," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 464-480, July.
    6. Constantinescu, Corina & Hashorva, Enkelejd & Ji, Lanpeng, 2011. "Archimedean copulas in finite and infinite dimensions—with application to ruin problems," Insurance: Mathematics and Economics, Elsevier, vol. 49(3), pages 487-495.
    7. Geurt Jongbloed & Ger Koole, 2001. "Managing uncertainty in call centres using Poisson mixtures," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 17(4), pages 307-318, October.
    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. Arendarczyk, Marek & Kozubowski, Tomasz. J. & Panorska, Anna K., 2018. "The joint distribution of the sum and maximum of dependent Pareto risks," Journal of Multivariate Analysis, Elsevier, vol. 167(C), pages 136-156.
    2. Constantinescu Corina D. & Kozubowski Tomasz J. & Qian Haoyu H., 2019. "Probability of ruin in discrete insurance risk model with dependent Pareto claims," Dependence Modeling, De Gruyter, vol. 7(1), pages 215-233, January.
    3. Jianxi Su & Edward Furman, 2016. "Multiple risk factor dependence structures: Copulas and related properties," Papers 1610.02126, arXiv.org.
    4. Marri, Fouad & Furman, Edward, 2012. "Pricing compound Poisson processes with the Farlie–Gumbel–Morgenstern dependence structure," Insurance: Mathematics and Economics, Elsevier, vol. 51(1), pages 151-157.
    5. Dutang, C. & Lefèvre, C. & Loisel, S., 2013. "On an asymptotic rule A+B/u for ultimate ruin probabilities under dependence by mixing," Insurance: Mathematics and Economics, Elsevier, vol. 53(3), pages 774-785.
    6. Enkelejd Hashorva & Lanpeng Ji, 2014. "Random Shifting and Scaling of Insurance Risks," Risks, MDPI, vol. 2(3), pages 1-12, July.
    7. Franc{c}ois Dufresne & Enkelejd Hashorva & Gildas Ratovomirija & Youssouf Toukourou, 2016. "On bivariate lifetime modelling in life insurance applications," Papers 1601.04351, arXiv.org.
    8. Yunan Liu & Ward Whitt & Yao Yu, 2016. "Approximations for heavily loaded G/GI/n + GI queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(3), pages 187-217, April.
    9. Castañer, A. & Claramunt, M.M. & Lefèvre, C. & Loisel, S., 2015. "Discrete Schur-constant models," Journal of Multivariate Analysis, Elsevier, vol. 140(C), pages 343-362.
    10. Britt W. J. Mathijsen & A. J. E. M. Janssen & Johan S. H. Leeuwaarden & Bert Zwart, 2018. "Robust heavy-traffic approximations for service systems facing overdispersed demand," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 257-289, December.
    11. Su, Jianxi & Furman, Edward, 2017. "Multiple risk factor dependence structures: Copulas and related properties," Insurance: Mathematics and Economics, Elsevier, vol. 74(C), pages 109-121.
    12. Ward Whitt & Jingtong Zhao, 2017. "Many‐server loss models with non‐poisson time‐varying arrivals," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 177-202, April.
    13. Castañer, A. & Claramunt, M.M. & Lefèvre, C. & Loisel, S., 2015. "Discrete Schur-constant models," Journal of Multivariate Analysis, Elsevier, vol. 140(C), pages 343-362.
    14. Ran Liu & Michael E. Kuhl & Yunan Liu & James R. Wilson, 2019. "Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 347-366, April.
    15. Ibrahim, Rouba & Ye, Han & L’Ecuyer, Pierre & Shen, Haipeng, 2016. "Modeling and forecasting call center arrivals: A literature survey and a case study," International Journal of Forecasting, Elsevier, vol. 32(3), pages 865-874.
    16. Ma, Ni & Whitt, Ward, 2016. "Efficient simulation of non-Poisson non-stationary point processes to study queueing approximations," Statistics & Probability Letters, Elsevier, vol. 109(C), pages 202-207.
    17. Noah Gans & Haipeng Shen & Yong-Pin Zhou & Nikolay Korolev & Alan McCord & Herbert Ristock, 2015. "Parametric Forecasting and Stochastic Programming Models for Call-Center Workforce Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 571-588, October.
    18. Manel Kacem & Stéphane Loisel & Véronique Maume-Deschamps, 2016. "Some mixing properties of conditionally independent processes," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(5), pages 1241-1259, March.
    19. Heemskerk, M. & Mandjes, M. & Mathijsen, B., 2022. "Staffing for many-server systems facing non-standard arrival processes," European Journal of Operational Research, Elsevier, vol. 296(3), pages 900-913.
    20. Xu Sun & Yunan Liu, 2021. "Staffing many‐server queues with autoregressive inputs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(3), pages 312-326, April.

    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:metcap:v:21:y:2019:i:4:d:10.1007_s11009-018-9683-7. 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.