IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i2p327-331.html
   My bibliography  Save this article

Monotone Optimal Policies for a Transient Queueing Staffing Problem

Author

Listed:
  • Michael C. Fu

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

  • Steven I. Marcus

    (Department of Electrical Engineering, University of Maryland, College Park, Maryland 20742)

  • I-Jeng Wang

    (The Johns Hopkins University Applied Physics Laboratory, Laurel, Maryland 20723)

Abstract

We consider the problem of determining the optimal policy for staffing a queueing system over multiple periods, using a model that takes into account transient queueing effects. Formulating the problem in a dynamic programming setting, we show that the optimal policy follows a monotone optimal control by establishing the submodularity of the objective function with respect to the staffing level and initial queue size in a period. In particular, this requires proving that the system occupancy in a G/M/s queue is submodular in the number of servers and initial system occupancy.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:2:p:327-331
    DOI: 10.1287/opre.48.2.327.13375
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nasuh Buyukkaramikli & Henny Ooijen & J. Bertrand, 2015. "Integrating inventory control and capacity management at a maintenance service provider," Annals of Operations Research, Springer, vol. 231(1), pages 185-206, August.
    2. Jerome Niyirora & Jamol Pender, 2016. "Optimal staffing in nonstationary service centers with constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 615-630, December.
    3. Nasuh Buyukkaramikli & J. Bertrand & Henny Ooijen, 2013. "Flexible hiring in a make to order system with parallel processing units," Annals of Operations Research, Springer, vol. 209(1), pages 159-178, October.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Zhe George Zhang, 2009. "Performance Analysis of a Queue with Congestion-Based Staffing Policy," Management Science, INFORMS, vol. 55(2), pages 240-251, February.

    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:oropre:v:48:y:2000:i:2:p:327-331. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.