IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v55y2009i2p240-251.html
   My bibliography  Save this article

Performance Analysis of a Queue with Congestion-Based Staffing Policy

Author

Listed:
  • Zhe George Zhang

    (Department of Decision Sciences, Western Washington University, Bellingham, Washington 98225; and Faculty of Business Administration, Simon Fraser University, Burnaby, British Columbia V5A 1S6, Canada)

Abstract

This paper analyzes a waiting line system that is motivated by the operations of border-crossing stations between the United States and Canada. There are two main conflicting goals in such a system: high security level, which often leads to a longer line; and good customer service, which requires a shorter line. Thus, unlike other queueing systems, maintaining the average queue length within a certain range is the primary objective. This is achieved using a staffing policy, called "congestion-based staffing," or CBS, where the number of servers (inspection booths) is adjusted according to the queue length during a planning period. We first present an exact benchmark model of Markovian type based on the matrix-geometric solution. For practical CBS policies, we develop a set of closed-form formulas for the major performance measures based on regenerative cycle analysis and fluid limit approximation. Numerical examples show that these approximation formulas are simple, accurate, and robust for practitioners to use in designing CBS policies.

Suggested Citation

  • Zhe George Zhang, 2009. "Performance Analysis of a Queue with Congestion-Based Staffing Policy," Management Science, INFORMS, vol. 55(2), pages 240-251, February.
    • Handle: RePEc:inm:ormnsc:v:55:y:2009:i:2:p:240-251
    DOI: 10.1287/mnsc.1080.0914
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1080.0914
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1080.0914?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
    ---><---

    References listed on IDEAS

    as
    1. Linda V. Green & Peter J. Kolesar & João Soares, 2001. "Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands," Operations Research, INFORMS, vol. 49(4), pages 549-564, August.
    2. Colin E. Bell, 1975. "Technical Note—Turning Off a Server with Customers Present: Is This Any Way to Run an M / M / c Queue with Removable Servers?," Operations Research, INFORMS, vol. 23(3), pages 571-574, June.
    3. Colin E. Bell, 1980. "Optimal Operation of an M / M /2 Queue with Removable Servers," Operations Research, INFORMS, vol. 28(5), pages 1189-1204, October.
    4. Michael C. Fu & Steven I. Marcus & I-Jeng Wang, 2000. "Monotone Optimal Policies for a Transient Queueing Staffing Problem," Operations Research, INFORMS, vol. 48(2), pages 327-331, April.
    5. Noah Gans & Yong-Pin Zhou, 2003. "A Call-Routing Problem with Service-Level Constraints," Operations Research, INFORMS, vol. 51(2), pages 255-271, April.
    6. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    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. Zhang, Zhe George & Kim, Ilhyung & Springer, Mark & Cai, Gangshu (George) & Yu, Yugang, 2013. "Dynamic pooling of make-to-stock and make-to-order operations," International Journal of Production Economics, Elsevier, vol. 144(1), pages 44-56.
    2. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.
    3. 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.
    4. Tirdad, Ali & Grassmann, Winfried K. & Tavakoli, Javad, 2016. "Optimal policies of M(t)/M/c/c queues with two different levels of servers," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1124-1130.
    5. Jiang, Yirui & Tran, Trung Hieu & Williams, Leon, 2023. "Machine learning and mixed reality for smart aviation: Applications and challenges," Journal of Air Transport Management, Elsevier, vol. 111(C).
    6. Nahla Dhib & Arvind Ashta, 2020. "How far can we go? Determining the optimal loan size in progressive lending," Working Papers hal-03001840, HAL.
    7. Song, Cen & Zhuang, Jun, 2017. "N-stage security screening strategies in the face of strategic applicants," Reliability Engineering and System Safety, Elsevier, vol. 165(C), pages 292-301.
    8. Liu, Zhongyi & Liu, Jingchen & Zhai, Xin & Wang, Guanying, 2019. "Police staffing and workload assignment in law enforcement using multi-server queueing models," European Journal of Operational Research, Elsevier, vol. 276(2), pages 614-625.
    9. Zhang, Zhe George & Yin, Xiaoling, 2021. "Information and pricing effects in two-tier public service systems," International Journal of Production Economics, Elsevier, vol. 231(C).
    10. Li Xia & Zhe George Zhang & Quan‐Lin Li, 2022. "A c/μ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1191-1215, March.
    11. Lingjiao Zhang & Jinting Wang & Yilin Wang, 2023. "Strategic Behavior and Optimization of an M/M/1 Queue with N-Policy and Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 25(4), pages 1-29, December.
    12. Zhe George Zhang & Hsing Paul Luh & Chia-Hung Wang, 2011. "Modeling Security-Check Queues," Management Science, INFORMS, vol. 57(11), pages 1979-1995, November.
    13. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    14. Pengfei Guo & Zhe George Zhang, 2013. "Strategic Queueing Behavior and Its Impact on System Performance in Service Systems with the Congestion-Based Staffing Policy," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 118-131, September.
    15. Pengfei Guo & Refael Hassin, 2011. "Strategic Behavior and Social Optimization in Markovian Vacation Queues," Operations Research, INFORMS, vol. 59(4), pages 986-997, August.
    16. Yu, Mengqiao & Ding, Yichuan & Lindsey, Robin & Shi, Cong, 2016. "A data-driven approach to manpower planning at U.S.–Canada border crossings," Transportation Research Part A: Policy and Practice, Elsevier, vol. 91(C), pages 34-47.
    17. Cen Song & Jun Zhuang, 2017. "Two-stage security screening strategies in the face of strategic applicants, congestions and screening errors," Annals of Operations Research, Springer, vol. 258(2), pages 237-262, November.

    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. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.
    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. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    4. 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.
    5. Dietz, Dennis C., 2011. "Practical scheduling for call center operations," Omega, Elsevier, vol. 39(5), pages 550-557, October.
    6. Zhang, Zhe G. & Tian, Naishuo, 2004. "An analysis of queueing systems with multi-task servers," European Journal of Operational Research, Elsevier, vol. 156(2), pages 375-389, July.
    7. Robbins, Thomas R. & Harrison, Terry P., 2010. "A stochastic programming model for scheduling call centers with global Service Level Agreements," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1608-1619, December.
    8. Ta, Thuy Anh & Chan, Wyean & Bastin, Fabian & L’Ecuyer, Pierre, 2021. "A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 293(3), pages 966-979.
    9. Avishai Mandelbaum & Sergey Zeltyn, 2009. "Staffing Many-Server Queues with Impatient Customers: Constraint Satisfaction in Call Centers," Operations Research, INFORMS, vol. 57(5), pages 1189-1205, October.
    10. Gabriel Zayas-Cabán & Mark E. Lewis, 2020. "Admission control in a two-class loss system with periodically varying parameters and abandonments," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 175-210, February.
    11. Itay Gurvich & Mor Armony & Avishai Mandelbaum, 2008. "Service-Level Differentiation in Call Centers with Fully Flexible Servers," Management Science, INFORMS, vol. 54(2), pages 279-294, February.
    12. B. Legros, 2022. "The Transient Blended Queue," Post-Print hal-04452674, HAL.
    13. 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.
    14. 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.
    15. R. E. Lillo, 2000. "Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model," Methodology and Computing in Applied Probability, Springer, vol. 2(2), pages 153-167, August.
    16. Noah Gans & Haipeng Shen & Yong-Pin Zhou & Nikolay Korolev & Alan McCord & Herbert Ristock, 2015. "Parametric Forecasting and Stochastic Programming Models for Call-Center Workforce Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 571-588, October.
    17. Tolga Tezcan & Banafsheh Behzad, 2012. "Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 386-401, July.
    18. Junxiang Li & Limei Yan & Shudong Li & Jiazhen Huo, 2012. "Inexact trust region PGC method for large sparse unconstrained optimization," Computational Optimization and Applications, Springer, vol. 51(3), pages 981-999, April.
    19. Soonhui Lee & Tito Homem-de-Mello & Anton Kleywegt, 2012. "Newsvendor-type models with decision-dependent uncertainty," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 189-221, October.
    20. Alex Roubos & Ger Koole & Raik Stolletz, 2012. "Service-Level Variability of Inbound Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 402-413, 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:inm:ormnsc:v:55:y:2009:i:2:p:240-251. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.