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

Optimal control of a single server in a finite-population queueing network

Author

Listed:
  • Nilay Tanık Argon

    (University of North Carolina)

  • Chao Deng

    (University of North Carolina)

  • Vidyadhar G. Kulkarni

    (University of North Carolina)

Abstract

We study the optimal dynamic assignment of a single server to multiple stations in a finite-population queueing network. The objective is to maximize the long-run average reward/throughput. We use sample-path comparisons to identify conditions on the network structure and service time distributions under which the optimal policy is an index policy. This index policy assigns the server to the non-empty station where it takes the shortest amount of time (in some stochastic sense) to complete a job. For example, in a network of multiple parallel stations, the optimal policy assigns the highest priority to the fastest station if service times can be ordered in likelihood ratios. Finally, by means of a numerical study, we test the shortest-expected-remaining-service-time policy on parallel-series networks with three stations and find that this index policy either coincides with the optimal policy or provides a near-optimal performance.

Suggested Citation

  • Nilay Tanık Argon & Chao Deng & Vidyadhar G. Kulkarni, 2017. "Optimal control of a single server in a finite-population queueing network," Queueing Systems: Theory and Applications, Springer, vol. 85(1), pages 149-172, February.
    • Handle: RePEc:spr:queues:v:85:y:2017:i:1:d:10.1007_s11134-016-9507-9
    DOI: 10.1007/s11134-016-9507-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-016-9507-9
    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-9507-9?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. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    2. Korwar, Ramesh M., 2002. "On Stochastic Orders for Sums of Independent Random Variables," Journal of Multivariate Analysis, Elsevier, vol. 80(2), pages 344-357, February.
    3. Francis de Véricourt & Otis B. Jennings, 2011. "Nurse Staffing in Medical Units: A Queueing Perspective," Operations Research, INFORMS, vol. 59(6), pages 1320-1331, December.
    4. Linus Schrage, 1968. "Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 16(3), pages 687-690, June.
    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. Konstantin Avrachenkov & Patrick Brown & Natalia Osipova, 2009. "Optimal choice of threshold in Two Level Processor Sharing," Annals of Operations Research, Springer, vol. 170(1), pages 21-39, September.
    2. Shuo Zeng & Moshe Dror, 2019. "Serving many masters: an agent and his principals," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(1), pages 23-59, August.
    3. Jongwoo Jeon & Subhash Kochar & Chul Park, 2006. "Dispersive ordering—Some applications and examples," Statistical Papers, Springer, vol. 47(2), pages 227-247, March.
    4. Kis, Tamas & Pesch, Erwin, 2005. "A review of exact solution methods for the non-preemptive multiprocessor flowshop problem," European Journal of Operational Research, Elsevier, vol. 164(3), pages 592-608, August.
    5. Feng, Haofang & Zhang, Sheng Hao & Zhang, Yong, 2023. "Managing production-inventory-maintenance systems with condition monitoring," European Journal of Operational Research, Elsevier, vol. 310(2), pages 698-711.
    6. Yuan, J.J. & Lin, Y.X. & Ng, C.T. & Cheng, T.C.E., 2007. "Approximability of single machine scheduling with fixed jobs to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 178(1), pages 46-56, April.
    7. Thomas Kittsteiner & Benny Moldovanu, 2005. "Priority Auctions and Queue Disciplines That Depend on Processing Time," Management Science, INFORMS, vol. 51(2), pages 236-248, February.
    8. Adam Wierman & Bert Zwart, 2012. "Is Tail-Optimal Scheduling Possible?," Operations Research, INFORMS, vol. 60(5), pages 1249-1257, October.
    9. Samuli Aalto & Ziv Scully, 2023. "Minimizing the mean slowdown in the M/G/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 187-210, August.
    10. Samuli Aalto & Urtzi Ayesta, 2009. "SRPT applied to bandwidth-sharing networks," Annals of Operations Research, Springer, vol. 170(1), pages 3-19, September.
    11. Azizoglu, Meral & Cakmak, Ergin & Kondakci, Suna, 2001. "A flexible flowshop problem with total flow time minimization," European Journal of Operational Research, Elsevier, vol. 132(3), pages 528-538, August.
    12. Ingolfsson, Armann & Almehdawe, Eman & Pedram, Ali & Tran, Monica, 2020. "Comparison of fluid approximations for service systems with state-dependent service rates and return probabilities," European Journal of Operational Research, Elsevier, vol. 283(2), pages 562-575.
    13. Predrag Jelenković & Xiaozhu Kang & Jian Tan, 2009. "Heavy-tailed limits for medium size jobs and comparison scheduling," Annals of Operations Research, Springer, vol. 170(1), pages 133-159, September.
    14. Andrei Sleptchenko & M. Eric Johnson, 2015. "Maintaining Secure and Reliable Distributed Control Systems," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 103-117, February.
    15. Rouba Ibrahim, 2022. "Personalized scheduling in service systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 445-447, April.
    16. Łukasz Kruk, 2017. "Edge minimality of EDF resource sharing networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 331-366, October.
    17. Shengli Lv, 2021. "Multi-Machine Repairable System with One Unreliable Server and Variable Repair Rate," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    18. Carri W. Chan & Vivek F. Farias & Gabriel J. Escobar, 2017. "The Impact of Delays on Service Times in the Intensive Care Unit," Management Science, INFORMS, vol. 63(7), pages 2049-2072, July.
    19. Opher Baron & Oded Berman & Dmitry Krass & Jianfu Wang, 2017. "Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis," Manufacturing & Service Operations Management, INFORMS, vol. 19(1), pages 52-71, February.
    20. Sahba, Pedram & BalcIog[small tilde]lu, BarIs, 2011. "The impact of transportation delays on repairshop capacity pooling and spare part inventories," European Journal of Operational Research, Elsevier, vol. 214(3), pages 674-682, November.

    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:1:d:10.1007_s11134-016-9507-9. 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.