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. 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.
    3. 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.
    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. 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.
    2. Samuli Aalto, 2006. "M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 309-325, October.
    3. Havinga, Maik J.A. & de Jonge, Bram, 2020. "Condition-based maintenance in the cyclic patrolling repairman problem," International Journal of Production Economics, Elsevier, vol. 222(C).
    4. Haolin Feng & Yiwu Jia & Siyi Zhou & Hongyi Chen & Teng Huang, 2023. "A Dataset of Service Time and Related Patient Characteristics from an Outpatient Clinic," Data, MDPI, vol. 8(3), pages 1-15, February.
    5. Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
    6. Ke, Jau-Chuan & Liu, Tzu-Hsin & Wu, Chia-Huang, 2015. "An optimum approach of profit analysis on the machine repair system with heterogeneous repairmen," Applied Mathematics and Computation, Elsevier, vol. 253(C), pages 40-51.
    7. Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
    8. Belzunce, Félix & Ruiz, José M. & Suárez-Llorens, Alfonso, 2008. "On multivariate dispersion orderings based on the standard construction," Statistics & Probability Letters, Elsevier, vol. 78(3), pages 271-281, February.
    9. Hessam Bavafa & Sergei Savin & Christian Terwiesch, 2021. "Customizing Primary Care Delivery Using E‐Visits," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4306-4327, November.
    10. Otis B. Jennings & Josh E. Reed, 2012. "An Overloaded Multiclass FIFO Queue with Abandonments," Operations Research, INFORMS, vol. 60(5), pages 1282-1295, October.
    11. Doroudi, Sherwin & Avgerinos, Thanassis & Harchol-Balter, Mor, 2021. "To clean or not to clean: Malware removal strategies for servers under load," European Journal of Operational Research, Elsevier, vol. 292(2), pages 596-609.
    12. David D. Cho & Kurt M. Bretthauer & Jan Schoenfelder, 2023. "Patient-to-nurse ratios: Balancing quality, nurse turnover, and cost," Health Care Management Science, Springer, vol. 26(4), pages 807-826, December.
    13. Luca Becchetti & Stefano Leonardi & Alberto Marchetti-Spaccamela & Guido Schäfer & Tjark Vredeveld, 2006. "Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 85-108, February.
    14. Pedram Sahba & Bariş Balciog̃lu & Dragan Banjevic, 2013. "Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 331-342, June.
    15. Yue Zhang & Martin L. Puterman & Matthew Nelson & Derek Atkins, 2012. "A Simulation Optimization Approach to Long-Term Care Capacity Planning," Operations Research, INFORMS, vol. 60(2), pages 249-261, April.
    16. William Liang & Barış Balcıog̃lu & Robert Svaluto, 2013. "Scheduling policies for a repair shop problem," Annals of Operations Research, Springer, vol. 211(1), pages 273-288, December.
    17. Samuli Aalto & Pasi Lassila & Prajwal Osti, 2016. "Whittle index approach to size-aware scheduling for time-varying channels with multiple states," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 195-225, August.
    18. Shekhar, Chandra & Kumar, Neeraj & Gupta, Amit & Kumar, Amit & Varshney, Shreekant, 2020. "Warm-spare provisioning computing network with switching failure, common cause failure, vacation interruption, and synchronized reneging," Reliability Engineering and System Safety, Elsevier, vol. 199(C).
    19. Nikhil Bansal & Bart Kamphorst & Bert Zwart, 2018. "Achievable Performance of Blind Policies in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 949-964, August.
    20. Zhang, Yiying & Cheung, Ka Chun, 2020. "On the increasing convex order of generalized aggregation of dependent random variables," Insurance: Mathematics and Economics, Elsevier, vol. 92(C), pages 61-69.

    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.