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

Two-parameter process limits for an infinite-server queue with arrival dependent service times

Author

Listed:
  • Pang, Guodong
  • Zhou, Yuhang

Abstract

We study an infinite-server queue with a general arrival process and a large class of general time-varying service time distributions. Specifically, customers’ service times are conditionally independent given their arrival times, and each customer’s service time, conditional on her arrival time, has a general distribution function. We prove functional limit theorems for the two-parameter processes Xe(t,y) and Xr(t,y) that represent the numbers of customers in the system at time t that have received an amount of service less than or equal to y, and that have a residual amount of service strictly greater than y, respectively. When the arrival process and the initial content process both have continuous Gaussian limits, we show that the two-parameter limit processes are continuous Gaussian random fields. In the proofs, we introduce a new class of sequential empirical processes with conditionally independent variables of non-stationary distributions, and employ the moment bounds resulting from the method of chaining for the two-parameter stochastic processes.

Suggested Citation

  • Pang, Guodong & Zhou, Yuhang, 2017. "Two-parameter process limits for an infinite-server queue with arrival dependent service times," Stochastic Processes and their Applications, Elsevier, vol. 127(5), pages 1375-1416.
    • Handle: RePEc:eee:spapps:v:127:y:2017:i:5:p:1375-1416
    DOI: 10.1016/j.spa.2016.08.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414916301314
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2016.08.003?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. Avishai Mandelbaum & Petar Momčilović, 2012. "Queues with Many Servers and Impatient Customers," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 41-65, February.
    2. Hongyuan Lu & Guodong Pang & Yuhang Zhou, 2016. "$$G/{ GI}/N(+{ GI})$$ G / G I / N ( + G I ) queues with service interruptions in the Halfin–Whitt regime," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 127-160, February.
    3. Anatolii Puhalskii, 2013. "On the $$M_t/M_t/K_t+M_t$$ queue in heavy traffic," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 119-148, August.
    4. Ward Whitt, 2006. "Fluid Models for Multiserver Queues with Abandonments," Operations Research, INFORMS, vol. 54(1), pages 37-54, February.
    5. William A. Massey, 1985. "Asymptotic Analysis of the Time Dependent M/M/1 Queue," Mathematics of Operations Research, INFORMS, vol. 10(2), pages 305-327, May.
    6. Hongyuan Lu & Guodong Pang & Yuhang Zhou, 2016. "$$G/{ GI}/N(+{ GI})$$ G / G I / N ( + G I ) queues with service interruptions in the Halfin–Whitt regime," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 127-160, February.
    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. Pang, Guodong & Zhou, Yuhang, 2018. "Functional limit theorems for a new class of non-stationary shot noise processes," Stochastic Processes and their Applications, Elsevier, vol. 128(2), pages 505-544.
    2. Guodong Pang & Yuhang Zhou, 2018. "Two-parameter process limits for infinite-server queues with dependent service times via chaining bounds," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 1-25, February.

    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. Avishai Mandelbaum & Petar Momčilović, 2017. "Personalized queues: the customer view, via a fluid model of serving least-patient first," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 23-53, October.
    2. Max Tschaikowski & Mirco Tribastone, 2017. "A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment," Annals of Operations Research, Springer, vol. 252(1), pages 101-120, May.
    3. A. Korhan Aras & Xinyun Chen & Yunan Liu, 2018. "Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment," Queueing Systems: Theory and Applications, Springer, vol. 89(1), pages 81-125, June.
    4. Jeunghyun Kim & Ramandeep S. Randhawa & Amy R. Ward, 2018. "Dynamic Scheduling in a Many-Server, Multiclass System: The Role of Customer Impatience in Large Systems," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 285-301, May.
    5. Guodong Pang & Yuhang Zhou, 2018. "Two-parameter process limits for infinite-server queues with dependent service times via chaining bounds," Queueing Systems: Theory and Applications, Springer, vol. 88(1), pages 1-25, February.
    6. Hongyuan Lu & Guodong Pang & Yuhang Zhou, 2016. "$$G/{ GI}/N(+{ GI})$$ G / G I / N ( + G I ) queues with service interruptions in the Halfin–Whitt regime," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(1), pages 127-160, February.
    7. Shuangchi He, 2020. "Diffusion Approximation for Efficiency-Driven Queues When Customers Are Patient," Operations Research, INFORMS, vol. 68(4), pages 1265-1284, July.
    8. Junfei Huang & Avishai Mandelbaum & Hanqin Zhang & Jiheng Zhang, 2017. "Refined Models for Efficiency-Driven Queues with Applications to Delay Announcements and Staffing," Operations Research, INFORMS, vol. 65(5), pages 1380-1397, October.
    9. 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.
    10. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    11. Yunan Liu & Ward Whitt, 2012. "Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals," Operations Research, INFORMS, vol. 60(6), pages 1551-1564, December.
    12. Xin Liu, 2019. "Diffusion approximations for double-ended queues with reneging in heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 49-87, February.
    13. Burak Büke & Hanyi Chen, 2017. "Fluid and diffusion approximations of probabilistic matching systems," Queueing Systems: Theory and Applications, Springer, vol. 86(1), pages 1-33, June.
    14. Avi Mandelbaum & Kavita Ramanan, 2010. "Directional Derivatives of Oblique Reflection Maps," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 527-558, August.
    15. Alexander L. Stolyar & Tolga Tezcan, 2011. "Shadow-Routing Based Control of Flexible Multiserver Pools in Overload," Operations Research, INFORMS, vol. 59(6), pages 1427-1444, December.
    16. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    17. Adan, Ivo J.B.F. & Boon, Marko A.A. & Weiss, Gideon, 2019. "Design heuristic for parallel many server systems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 259-277.
    18. Otis B. Jennings & Josh E. Reed, 2012. "An Overloaded Multiclass FIFO Queue with Abandonments," Operations Research, INFORMS, vol. 60(5), pages 1282-1295, October.
    19. Zhenghua Long & Nahum Shimkin & Hailun Zhang & Jiheng Zhang, 2020. "Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ / h Rule," Operations Research, INFORMS, vol. 68(4), pages 1128-1230, July.
    20. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.

    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:127:y:2017:i:5:p:1375-1416. 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.