IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i15p2661-d874564.html
   My bibliography  Save this article

Pseudo Steady-State Period in Non-Stationary Infinite-Server Queue with State Dependent Arrival Intensity

Author

Listed:
  • Anatoly Nazarov

    (Institute of Applied Mathematics and Computer Science, Tomsk State University, 634050 Tomsk, Russia)

  • Alexander Dudin

    (Faculty of Applied Mathematics and Informatics, Belarusian State University, 220030 Minsk, Belarus)

  • Alexander Moiseev

    (Institute of Applied Mathematics and Computer Science, Tomsk State University, 634050 Tomsk, Russia)

Abstract

An infinite-server queueing model with state-dependent arrival process and exponential distribution of service time is analyzed. It is assumed that the difference between the value of the arrival rate and total service rate becomes positive starting from a certain value of the number of customers in the system. In this paper, time until reaching this value by the number of customers in the system is called the pseudo steady-state period ( P S S P ). Distribution of duration of P S S P , its raw moments and its simple approximation under a certain scaling of the number of customers in the system are analyzed. Novelty of the considered problem consists of an arbitrary dependence of the rate of customer arrival on the current number of customers in the system and analysis of time until reaching from below a certain level by the number of customers in the system. The relevant existing papers focus on the analysis of time interval since exceeding a certain level until the number of customers goes down to this level (congestion period). Our main contribution consists of the derivation of a simple approximation of the considered time distribution by the exponential distribution. Numerical examples are presented, which confirm good quality of the proposed approximation.

Suggested Citation

  • Anatoly Nazarov & Alexander Dudin & Alexander Moiseev, 2022. "Pseudo Steady-State Period in Non-Stationary Infinite-Server Queue with State Dependent Arrival Intensity," Mathematics, MDPI, vol. 10(15), pages 1-12, July.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:15:p:2661-:d:874564
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/15/2661/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/15/2661/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Anatoly Nazarov & Tuan Phung-Duc & Svetlana Paul & Olga Lizyura, 2022. "Diffusion Limit for Single-Server Retrial Queues with Renewal Input and Outgoing Calls," Mathematics, MDPI, vol. 10(6), pages 1-14, March.
    2. 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.
    3. Moiseev, Alexander & Nazarov, Anatoly, 2016. "Queueing network MAP−(GI/∞)K with high-rate arrivals," European Journal of Operational Research, Elsevier, vol. 254(1), pages 161-168.
    4. Woollcott Smith, 1972. "Technical Note—The Infinitely-Many-Server Queue with Semi-Markovian Arrivals and Customer-Dependent Exponential Service Times," Operations Research, INFORMS, vol. 20(4), pages 907-912, August.
    5. Yiran Liu & Harsha Honnappa & Samy Tindel & Nung Kwan Yip, 2021. "Infinite server queues in a random fast oscillatory environment," Queueing Systems: Theory and Applications, Springer, vol. 98(1), pages 145-179, June.
    6. Anatoly Nazarov & Alexander Moiseev & Svetlana Moiseeva, 2021. "Mathematical Model of Call Center in the Form of Multi-Server Queueing System," Mathematics, MDPI, vol. 9(22), pages 1-13, November.
    7. Ward Whitt, 1992. "Understanding the Efficiency of Multi-Server Service Systems," Management Science, INFORMS, vol. 38(5), pages 708-723, May.
    8. M. Ramalhoto, 1999. "The infinite server queue and heuristic approximations to the multi-server queue with and without retrials," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 333-350, December.
    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. Anatoly Nazarov & Ekaterina Fedorova & Olga Lizyura & Radmir Salimzyanov, 2023. "Asymptotic Diffusion Method for Retrial Queues with State-Dependent Service Rate," Mathematics, MDPI, vol. 11(14), pages 1-10, July.

    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. Achal Bassamboo & J. Michael Harrison & Assaf Zeevi, 2006. "Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method," Operations Research, INFORMS, vol. 54(3), pages 419-435, June.
    2. 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.
    3. Ari Arapostathis & Hassan Hmedi & Guodong Pang, 2021. "On Uniform Exponential Ergodicity of Markovian Multiclass Many-Server Queues in the Halfin–Whitt Regime," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 772-796, May.
    4. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    5. Marcus Ang & Karl Sigman & Jing-Sheng Song & Hanqin Zhang, 2017. "Closed-Form Approximations for Optimal ( r , q ) and ( S , T ) Policies in a Parallel Processing Environment," Operations Research, INFORMS, vol. 65(5), pages 1414-1428, October.
    6. O. Garnet & A. Mandelbaum & M. Reiman, 2002. "Designing a Call Center with Impatient Customers," Manufacturing & Service Operations Management, INFORMS, vol. 4(3), pages 208-227, October.
    7. A. J. E. M. Janssen & J. S. H. van Leeuwaarden & Bert Zwart, 2011. "Refining Square-Root Safety Staffing by Expanding Erlang C," Operations Research, INFORMS, vol. 59(6), pages 1512-1522, December.
    8. Venkateshan, Prahalad & Mathur, Kamlesh & Ballou, Ronald H., 2010. "Locating and staffing service centers under service level constraints," European Journal of Operational Research, Elsevier, vol. 201(1), pages 55-70, February.
    9. Josh Reed & Bo Zhang, 2017. "Managing capacity and inventory jointly for multi-server make-to-stock queues," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 61-94, June.
    10. Alfonso J. Pedraza-Martinez & Sameer Hasija & Luk N. Van Wassenhove, 2020. "Fleet Coordination in Decentralized Humanitarian Operations Funded by Earmarked Donations," Operations Research, INFORMS, vol. 68(4), pages 984-999, July.
    11. Ward Whitt, 2003. "How Multiserver Queues Scale with Growing Congestion-Dependent Demand," Operations Research, INFORMS, vol. 51(4), pages 531-542, August.
    12. 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.
    13. Opher Baron & Joseph Milner, 2009. "Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements," Operations Research, INFORMS, vol. 57(3), pages 685-700, June.
    14. Harris, K.R. & Trappeniers, N.J., 1980. "The density dependence of the self-diffusion coefficient of liquid methane," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 104(1), pages 262-280.
    15. Constantinos Maglaras & Assaf Zeevi, 2004. "Diffusion Approximations for a Multiclass Markovian Service System with “Guaranteed” and “Best-Effort” Service Levels," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 786-813, November.
    16. Amir Elalouf & Guy Wachtel, 2022. "Queueing Problems in Emergency Departments: A Review of Practical Approaches and Research Methodologies," SN Operations Research Forum, Springer, vol. 3(1), pages 1-46, March.
    17. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    18. Constantinos Maglaras & Assaf Zeevi, 2003. "Pricing and Capacity Sizing for Systems with Shared Resources: Approximate Solutions and Scaling Relations," Management Science, INFORMS, vol. 49(8), pages 1018-1038, August.
    19. Hassan Hmedi & Ari Arapostathis & Guodong Pang, 2022. "Uniform stability of some large-scale parallel server networks," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 509-552, December.
    20. Izady, Navid & Worthington, Dave, 2012. "Setting staffing requirements for time dependent queueing networks: The case of accident and emergency departments," European Journal of Operational Research, Elsevier, vol. 219(3), pages 531-540.

    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:gam:jmathe:v:10:y:2022:i:15:p:2661-:d:874564. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.