IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v85y2017i3d10.1007_s11134-016-9511-0.html
   My bibliography  Save this article

Transient error approximation in a Lévy queue

Author

Listed:
  • Britt Mathijsen

    (Eindhoven University of Technology)

  • Bert Zwart

    (Eindhoven University of Technology
    Centrum Wiskunde & Informatica)

Abstract

Motivated by a capacity allocation problem within a finite planning period, we conduct a transient analysis of a single-server queue with Lévy input. From a cost minimization perspective, we investigate the error induced by using stationary congestion measures as opposed to time-dependent measures. Invoking recent results from fluctuation theory of Lévy processes, we derive a refined cost function, that accounts for transient effects. This leads to a corrected capacity allocation rule for the transient single-server queue. Extensive numerical experiments indicate that the cost reductions achieved by this correction can be significant.

Suggested Citation

  • Britt Mathijsen & Bert Zwart, 2017. "Transient error approximation in a Lévy queue," Queueing Systems: Theory and Applications, Springer, vol. 85(3), pages 269-304, April.
    • Handle: RePEc:spr:queues:v:85:y:2017:i:3:d:10.1007_s11134-016-9511-0
    DOI: 10.1007/s11134-016-9511-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-016-9511-0
    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-016-9511-0?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. Amedeo R. Odoni & Emily Roth, 1983. "An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems," Operations Research, INFORMS, vol. 31(3), pages 432-455, June.
    2. Linda Green & Peter Kolesar, 1991. "The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals," Management Science, INFORMS, vol. 37(1), pages 84-97, January.
    3. Ramandeep S. Randhawa, 2016. "Optimality gap of asymptotically derived prescriptions in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 131-155, June.
    4. Claude Dennis Pegden & Matthew Rosenshine, 1982. "Some New Results for the M/M/1 Queue," Management Science, INFORMS, vol. 28(7), pages 821-828, July.
    5. Joseph Abate & Ward Whitt, 1994. "Transient Behavior of the M/G/1 Workload Process," Operations Research, INFORMS, vol. 42(4), pages 750-764, August.
    6. Bo Zhang & Johan S. H. van Leeuwaarden & Bert Zwart, 2012. "Staffing Call Centers with Impatient Customers: Refinements to Many-Server Asymptotics," Operations Research, INFORMS, vol. 60(2), pages 461-474, April.
    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.
    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. 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.
    2. Armann Ingolfsson & Elvira Akhmetshina & Susan Budge & Yongyue Li & Xudong Wu, 2007. "A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary M(t)/M/s(t) Queueing Systems with Exhaustive Discipline," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 201-214, May.
    3. 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.
    4. Ramandeep S. Randhawa, 2016. "Optimality gap of asymptotically derived prescriptions in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 131-155, June.
    5. Eugene Furman & Adam Diamant & Murat Kristal, 2021. "Customer Acquisition and Retention: A Fluid Approach for Staffing," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4236-4257, November.
    6. 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.
    7. Ward Whitt, 2007. "What you should know about queueing models to set staffing requirements in service systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 476-484, August.
    8. Barış Ata & Xiaoshan Peng, 2020. "An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis," Operations Research, INFORMS, vol. 68(2), pages 327-347, March.
    9. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    10. Carolina Osorio & Jana Yamani, 2017. "Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks," Transportation Science, INFORMS, vol. 51(3), pages 823-840, August.
    11. Xi Chen & Dave Worthington, 2017. "Staffing of time-varying queues using a geometric discrete time modelling approach," Annals of Operations Research, Springer, vol. 252(1), pages 63-84, May.
    12. Barth, Wolfgang & Manitz, Michael & Stolletz, Raik, 2008. "Analysis of Two-Level Support Systems with Time-Dependent Overflow - A Banking Application," Hannover Economic Papers (HEP) dp-399, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    13. Robert M. Saltzman & Vijay Mehrotra, 2001. "A Call Center Uses Simulation to Drive Strategic Change," Interfaces, INFORMS, vol. 31(3), pages 87-101, June.
    14. Yifan Liu & Lawrence M. Wein, 2008. "A Queueing Analysis to Determine How Many Additional Beds Are Needed for the Detention and Removal of Illegal Aliens," Management Science, INFORMS, vol. 54(1), pages 1-15, January.
    15. Long He & Ho-Yin Mak & Ying Rong & Zuo-Jun Max Shen, 2017. "Service Region Design for Urban Electric Vehicle Sharing Systems," Manufacturing & Service Operations Management, INFORMS, vol. 19(2), pages 309-327, May.
    16. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.
    17. Sergey Stepanov & Mikhail Stepanov, 2021. "Estimation of the Performance Measures of a Group of Servers Taking into Account Blocking and Call Repetition before and after Server Occupation," Mathematics, MDPI, vol. 9(21), pages 1-24, November.
    18. Missbauer, Hubert, 2009. "Models of the transient behaviour of production units to optimize the aggregate material flow," International Journal of Production Economics, Elsevier, vol. 118(2), pages 387-397, April.
    19. J. G. Dai & Pengyi Shi, 2017. "A Two-Time-Scale Approach to Time-Varying Queues in Hospital Inpatient Flow Management," Operations Research, INFORMS, vol. 65(2), pages 514-536, April.
    20. Moshe Haviv & Ramandeep S. Randhawa, 2014. "Pricing in Queues Without Demand Information," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 401-411, 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:85:y:2017:i:3:d:10.1007_s11134-016-9511-0. 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.