Advertisement

Queueing Systems

, Volume 85, Issue 1–2, pp 149–172 | Cite as

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

  • Nilay Tanık Argon
  • Chao Deng
  • Vidyadhar G. Kulkarni
Article

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.

Keywords

Scheduling Queueing networks Likelihood ratio ordering SEPT 

Mathematics Subject Classification

68M20 60K25 90B22 90B36 

Notes

Acknowledgements

The authors thank the associate editor and an anonymous referee for their comments on an earlier version of this article, which significantly improved it. The work of the first author was partially supported by the National Science Foundation under grants CMMI–1234212 and CMMI–1635574.

References

  1. 1.
    Ahn, H.-S., Righter, R.: Dynamic load balancing with flexible workers. Adv. Appl. Probab. 38(3), 621–642 (2006)CrossRefGoogle Scholar
  2. 2.
    de Véricourt, F., Jennings, O.B.: Nurse staffing in medical units: a queueing perspective. Oper. Res. 59(6), 1320–1331 (2011)CrossRefGoogle Scholar
  3. 3.
    Dshalalow, H.J.: Frontiers in Queueing: Models and Applications in Science and Engineering. CRC Press, Boca Raton (1997)Google Scholar
  4. 4.
    Haque, L., Armstrong, M.J.: A survey of the machine interference problem. Eur. J. Oper. Res. 179(2), 469–482 (2007)CrossRefGoogle Scholar
  5. 5.
    Haverkort, R.B.: Performance of Computer Communication Systems: A Model-Based Approach. Wiley, New York (1998)CrossRefGoogle Scholar
  6. 6.
    Hopp, W.J., Iravani, S.M.R., Shou, B.Y., Lien, R.: Design and control of agile automated conwip production lines. Nav. Res. Logist. 56(1), 42–56 (2009)CrossRefGoogle Scholar
  7. 7.
    Iravani, S.M.R., Kolfal, B.: When does the c\(\mu \) rule apply to finite-population queueing systems? Oper. Res. Lett. 33(3), 301–304 (2005)CrossRefGoogle Scholar
  8. 8.
    Iravani, S.M.R., Krishnamurthy, V., Chao, G.H.: Optimal server scheduling in nonpreemptive finite-population queueing systems. Queueing Syst. 55(2), 95–105 (2007)CrossRefGoogle Scholar
  9. 9.
    King, J.B.P.: Computer and Communication System Performance Modelling. Prentice-Hall, Upper Saddle River (1990)Google Scholar
  10. 10.
    Koole, G., Righter, R.: Optimal control of tandem reentrant queues. Queueing Syst. 28(4), 337–347 (1998)CrossRefGoogle Scholar
  11. 11.
    Korwar, R.M.: On stochastic orders for sums of independent random variables. J. Multivar. Anal. 80, 344–357 (2002)CrossRefGoogle Scholar
  12. 12.
    Müller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, Chichester (2002)Google Scholar
  13. 13.
    Palesano, J., Chandra, J.: A machine interference problem with multiple types of failures. Int. J. Prod. Res. 24(3), 567–582 (1986)CrossRefGoogle Scholar
  14. 14.
    Righter, R.: Scheduling. In: Shaked, M., Shanthikumar, J.G. (eds.) Stochastic Orders and Their Applications, Chapter 13, pp. 381–432. Academic Press, New York (1994)Google Scholar
  15. 15.
    Righter, R., Shanthikumar, J.G.: Extremal properties of the fifo discipline in queueing networks. J. Appl. Probab. 29(4), 967–978 (1992)CrossRefGoogle Scholar
  16. 16.
    Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3), 687–690 (1968)CrossRefGoogle Scholar
  17. 17.
    Shaked, M., Shanthikumar, J.G.: Stochastic Orders. Springer, New York (2007)CrossRefGoogle Scholar
  18. 18.
    Stecke, K.E., Aronson, J.E.: Review of operator/machine interference models. Int. J. Prod. Res. 23(1), 129–151 (1985)CrossRefGoogle Scholar
  19. 19.
    Sztrik, J.: Finite source queuing systems and their applications: A bibliography. http://irh.inf.unideb.hu/user/jsztrik/research/fsqreview.pdf (2001)
  20. 20.
    Takagi, H.: Stochastic Analysis of Computer and Communication Systems. North-Holland, Amsterdam (1990)Google Scholar
  21. 21.
    Van Oyen, M.P., Gel, E.G.S., Hopp, W.J.: Performance opportunity for workforce agility in collaborative and noncollaborative work systems. IIE Trans. 33(9), 761–777 (2001)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Department of Statistics and Operations ResearchUniversity of North CarolinaChapel HillUSA

Personalised recommendations