IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v123y2013i6p2175-2227.html
   My bibliography  Save this article

On finite capacity queues with time dependent arrival rates

Author

Listed:
  • Tan, Xiaoqian
  • Knessl, Charles
  • Yang, Yongzhi (Peter)

Abstract

We consider the finite capacity M/M/1−K queue with a time dependent arrival rate λ(t). Assuming that the capacity K is large and that the arrival rate varies slowly with time (as t/K), we construct asymptotic approximations to the probability of finding n customers in the system at time t, as well as the mean number. We consider various time ranges, where the system is nearly empty, nearly full, or is filled to a fraction of its capacity. Extensive numerical studies are used to back up the asymptotic analysis.

Suggested Citation

  • Tan, Xiaoqian & Knessl, Charles & Yang, Yongzhi (Peter), 2013. "On finite capacity queues with time dependent arrival rates," Stochastic Processes and their Applications, Elsevier, vol. 123(6), pages 2175-2227.
    • Handle: RePEc:eee:spapps:v:123:y:2013:i:6:p:2175-2227
    DOI: 10.1016/j.spa.2013.02.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414913000409
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2013.02.002?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. Bernard O. Koopman, 1972. "Air-Terminal Queues under Time-Dependent Conditions," Operations Research, INFORMS, vol. 20(6), pages 1089-1114, December.
    2. Basawa, I.V. & Bhat, U.N. & Zhou, J., 2008. "Parameter estimation using partial information with applications to queueing and related models," Statistics & Probability Letters, Elsevier, vol. 78(12), pages 1375-1383, September.
    3. T. Collings & C. Stoneman, 1976. "The M / M /∞ Queue with Varying Arrival and Departure Rates," Operations Research, INFORMS, vol. 24(4), pages 760-773, August.
    4. Avi Mandelbaum & William A. Massey, 1995. "Strong Approximations for Time-Dependent Queues," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 33-64, February.
    5. Linda Green & Peter Kolesar, 1989. "Testing the Validity of a Queueing Model of Police Patrol," Management Science, INFORMS, vol. 35(2), pages 127-148, February.
    6. Peter Kolesar, 1984. "Stalking the Endangered CAT: A Queueing Analysis of Congestion at Automatic Teller Machines," Interfaces, INFORMS, vol. 14(6), pages 16-26, December.
    7. Michael H. Rothkopf & Shmuel S. Oren, 1979. "A Closure Approximation for the Nonstationary M/M/s Queue," Management Science, INFORMS, vol. 25(6), pages 522-534, June.
    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. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.

    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. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    2. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    3. Ward Whitt & Wei You, 2019. "Time-Varying Robust Queueing," Operations Research, INFORMS, vol. 67(6), pages 1766-1782, November.
    4. Michael R. Taaffe & Gordon M. Clark, 1988. "Approximating nonstationary two‐priority non‐preemptive queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 125-145, February.
    5. Jamol Pender, 2017. "Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 1-17, February.
    6. Linda V. Green & Peter J. Kolesar, 1998. "A Note on Approximating Peak Congestion in Mt/G/\infty Queues with Sinusoidal Arrivals," Management Science, INFORMS, vol. 44(11-Part-2), pages 137-144, November.
    7. Stolletz, Raik, 2008. "Approximation of the non-stationary M(t)/M(t)/c(t)-queue using stationary queueing models: The stationary backlog-carryover approach," European Journal of Operational Research, Elsevier, vol. 190(2), pages 478-493, October.
    8. Wang, Haiyan & Olsen, Tava Lennon & Liu, Guiqing, 2018. "Service capacity competition with peak arrivals and delay sensitive customers," Omega, Elsevier, vol. 77(C), pages 80-95.
    9. Marcos Singer & Patricio Donoso & Natalia Jadue, 2004. "Evaluacion De Las Oportunidades De Mejoramiento De La Logistica Directa De Emergencia," Abante, Escuela de Administracion. Pontificia Universidad Católica de Chile., vol. 7(2), pages 179-209.
    10. Shone, Rob & Glazebrook, Kevin & Zografos, Konstantinos G., 2019. "Resource allocation in congested queueing systems with time-varying demand: An application to airport operations," European Journal of Operational Research, Elsevier, vol. 276(2), pages 566-581.
    11. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    12. Daniel, Joseph I, 1995. "Congestion Pricing and Capacity of Large Hub Airports: A Bottleneck Model with Stochastic Queues," Econometrica, Econometric Society, vol. 63(2), pages 327-370, March.
    13. Oualid Jouini & Zeynep Akşin & Yves Dallery, 2011. "Call Centers with Delay Information: Models and Insights," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 534-548, October.
    14. Tasos Nikoleris & Mark Hansen, 2012. "Queueing Models for Trajectory-Based Aircraft Operations," Transportation Science, INFORMS, vol. 46(4), pages 501-511, November.
    15. K. Srinivasa Rao & J. Durga Aparajitha, 2019. "On two node tandem queueing model with time dependent service rates," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(1), pages 19-34, February.
    16. Allan, Andrew L. & Liu, Chong & Prömel, David J., 2021. "Càdlàg rough differential equations with reflecting barriers," Stochastic Processes and their Applications, Elsevier, vol. 142(C), pages 79-104.
    17. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    18. Yijie Peng & Michael C. Fu & Bernd Heidergott & Henry Lam, 2020. "Maximum Likelihood Estimation by Monte Carlo Simulation: Toward Data-Driven Stochastic Modeling," Operations Research, INFORMS, vol. 68(6), pages 1896-1912, November.
    19. Yongjiang Guo & Yunan Liu & Renhu Pei, 2018. "Functional law of the iterated logarithm for multi-server queues with batch arrivals and customer feedback," Annals of Operations Research, Springer, vol. 264(1), pages 157-191, May.
    20. Nicole Adler & Alfred Hakkert & Jonathan Kornbluth & Tal Raviv & Mali Sher, 2014. "Location-allocation models for traffic police patrol vehicles on an interurban network," Annals of Operations Research, Springer, vol. 221(1), pages 9-31, October.

    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:eee:spapps:v:123:y:2013:i:6:p:2175-2227. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.