IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v89y2018i3d10.1007_s11134-017-9557-7.html
   My bibliography  Save this article

M/G/1 queue with event-dependent arrival rates

Author

Listed:
  • Benjamin Legros

    (Université Paris-Saclay)

Abstract

Motivated by experiments on customers’ behavior in service systems, we consider a queueing model with event-dependent arrival rates. Customers’ arrival rates depend on the last event, which may either be a service departure or an arrival. We derive explicitly the performance measures and analyze the impact of the event-dependency. In particular, we show that this queueing model, in which a service completion generates a higher arrival rate than an arrival, performs better than a system in which customers are insensitive to the last event. Moreover, contrary to the M/G/1 queue, we show that the coefficient of variation of the service does not necessarily deteriorate the system performance. Next, we show that this queueing model may be the result of customers’ strategic behavior when only the last event is known. Finally, we investigate the historical admission control problem. We show that, under certain conditions, a deterministic policy with two thresholds may be optimal. This new policy is easy to implement and provides an improvement compared to the classical one-threshold policy.

Suggested Citation

  • Benjamin Legros, 2018. "M/G/1 queue with event-dependent arrival rates," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 269-301, August.
    • Handle: RePEc:spr:queues:v:89:y:2018:i:3:d:10.1007_s11134-017-9557-7
    DOI: 10.1007/s11134-017-9557-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-017-9557-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/s11134-017-9557-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. Boxma, O. J., 1984. "Joint distribution of sojourn time and queue length in the M/G/1 queue with (in) finite capacity," European Journal of Operational Research, Elsevier, vol. 16(2), pages 246-256, May.
    2. J. Michael Harrison & Sidney I. Resnick, 1976. "The Stationary Distribution and First Exit Probabilities of a Storage Process with General Release Rule," Mathematics of Operations Research, INFORMS, vol. 1(4), pages 347-358, November.
    3. Hsing Paul Luh & Ioannis Viniotis, 2002. "Threshold control policies for heterogeneous server systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 121-142, March.
    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. Ger Koole, 2022. "The slow-server problem with multiple slow servers," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 469-471, April.
    2. Patrice Bertail & Stéphan Clémençon, 2005. "Regeneration-based Statistics for Harris Recurrent Markov Chains," Working Papers 2005-13, Center for Research in Economics and Statistics.
    3. Bertail, Patrice & Clemencon, Stephan, 2008. "Approximate regenerative-block bootstrap for Markov chains," Computational Statistics & Data Analysis, Elsevier, vol. 52(5), pages 2739-2756, January.
    4. Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik & Andreas Plank, 2020. "Approximations in Performance Analysis of a Controllable Queueing System with Heterogeneous Servers," Mathematics, MDPI, vol. 8(10), pages 1-18, October.
    5. Jiyeon Lee, 2007. "First exit times for compound Poisson dams with a general release rule," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(1), pages 169-178, February.
    6. O. Boxma & A. Löpker & D. Perry, 2016. "On a make-to-stock production/mountain modeln with hysteretic control," Annals of Operations Research, Springer, vol. 241(1), pages 53-82, June.
    7. Sotirios Losidis & Konstadinos Politis & Georgios Psarrakos, 2021. "Exact Results and Bounds for the Joint Tail and Moments of the Recurrence Times in a Renewal Process," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1489-1505, December.
    8. Jazeem Abdul Jaleel & Sherwin Doroudi & Kristen Gardner & Alexander Wickeham, 2022. "A general “power-of-d” dispatching framework for heterogeneous systems," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 431-480, December.
    9. Patrice Bertail & Stéphan Clémençon, 2006. "Approximate Regenerative-block Bootstrap for Markov Chains : Some Simulation Studies," Working Papers 2006-19, Center for Research in Economics and Statistics.
    10. Oz, Binyamin & Adan, Ivo & Haviv, Moshe, 2019. "The Mn/Gn/1 queue with vacations and exhaustive service," European Journal of Operational Research, Elsevier, vol. 277(3), pages 945-952.
    11. Andreas Löpker, 2016. "On the overflow time of a fluid model," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 59-92, August.
    12. A. Lust & K.-H. Waldmann, 2019. "A general storage model with applications to energy systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 71-97, March.
    13. Montagnon, Pierre, 2020. "Stability of piecewise deterministic Markovian metapopulation processes on networks," Stochastic Processes and their Applications, Elsevier, vol. 130(3), pages 1515-1544.
    14. Erhun Özkan & Jeffrey Kharoufeh, 2015. "Incompleteness of results for the slow-server problem with an unreliable fast server," Annals of Operations Research, Springer, vol. 226(1), pages 741-745, March.
    15. Zhao, Yu & Zhang, Liping & Yuan, Sanling, 2018. "The effect of media coverage on threshold dynamics for a stochastic SIS epidemic model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 248-260.
    16. Yutaka Sakuma & Onno Boxma & Tuan Phung-Duc, 2021. "An M/PH/1 queue with workload-dependent processing speed and vacations," Queueing Systems: Theory and Applications, Springer, vol. 98(3), pages 373-405, August.
    17. Liu, Yuting & Shan, Meijing & Lian, Xinze & Wang, Weiming, 2016. "Stochastic extinction and persistence of a parasite–host epidemiological model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 586-602.
    18. Boxma, Onno & Frostig, Esther & Perry, David & Yosef, Rami, 2017. "A state dependent reinsurance model," Insurance: Mathematics and Economics, Elsevier, vol. 74(C), pages 170-181.
    19. Onno Boxma & Michel Mandjes, 2021. "Shot-noise queueing models," Queueing Systems: Theory and Applications, Springer, vol. 99(1), pages 121-159, October.
    20. Borovkov, K. & Novikov, A., 2001. "On a piece-wise deterministic Markov process model," Statistics & Probability Letters, Elsevier, vol. 53(4), pages 421-428, July.

    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:queues:v:89:y:2018:i:3:d:10.1007_s11134-017-9557-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.