Skip to main content Accessibility help
×
Home

MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS

  • Sigrún Andradóttir (a1), Hayriye Ayhan (a1) and Douglas G. Down (a2)

Abstract

Consider a tandem queuing network with an infinite supply of jobs in front of the first station, infinite room for completed jobs after the last station, finite buffers between stations, and a number of flexible servers who are subject to failures. We study the dynamic assignment of servers to stations with the goal of maximizing the long-run average throughput. Our main conclusion is that the presence of server failures does not have a major impact on the optimal assignment of servers to stations for the systems we consider. More specifically, we show that when the servers are generalists, any nonidling policy is optimal, irrespective of the reliability of the servers. We also provide theoretical and numerical results for Markovian systems with two stations and two or three servers that suggest that the structure of the optimal server assignment policy does not depend on the reliability of the servers and that ignoring server failures when assigning servers to stations yields near-optimal throughput. Finally, we present numerical results that illustrate that simple server assignment heuristics designed for larger systems with reliable servers also yield good throughput performance in Markovian systems with three stations and three failure-prone servers.

Copyright

References

Hide All
1.Andradóttir, S. & Ayhan, H. (2005). Throughput maximization for tandem lines with two stations and flexible servers. Operations Research 53: 516531.
2.Andradóttir, S., Ayhan, H., & Down, D.G. (2001). Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Science 47: 14211439.
3.Andradóttir, S., Ayhan, H., & Down, D.G. (2007). Compensating for failures with flexible servers. Operations Research 55: 753768.
4.Andradóttir, S., Ayhan, H., & Down, D.G. (2007). Dynamic assignment of dedicated and flexible servers in tandem lines. Probability in the Engineering and Informational Sciences 21: 497538.
5.Argon, N.T., Ding, L., Glazebrook, K.D., & Ziya, S. (2007). Dynamic routing of customers with general delay costs in a multi-server queueing system. Probability in the Engineering and Informational Sciences (to appear).
6.Bazaraa, M.S., Jarvis, J.J., & Sherali, H.D. (1990). Linear programming and network flows. New York: Wiley.
7.Doshi, H.T. (1986). Queueing systems with vacations: A survey. Queueing Systems 1: 2966.
8.Hopp, W.J. & van Oyen, M.P. (2004). Agile workforce evaluation: A framework for cross-training and coordination. IIE Transactions 36: 919940.
9.Puterman, M.L. (1994). Markov decision processes. New York: Wiley.
10.Ross, S.M. (1996). Stochastic processes, 2nd ed.New York: Wiley.
11.Takagi, H. (1991). Queueing analysis: A foundation of performance evaluation. Vol. 1: Vacation and priority systems. Amsterdam: North-Holland.
12.Van Oyen, M.P., Gel, E.G.S., & Hopp, W.J. (2001). Performance opportunity for workforce agility in collaborative and noncollaborative work systems. IIE Transactions 33: 761777.
13.Wu, C.-H., Down, D.G., & Lewis, M.E. (2005). Heuristics for allocation of reconfigurable resources in a serial line with reliability considerations. Preprint.
14.Wu, C.-H., Lewis, M.E., & Veatch, M. (2006). Dynamic allocation of reconfigurable resources in a two-stage tandem queueing system with reliability considerations. IEEE Transactions on Automatic Control 51: 309314.

Related content

Powered by UNSILO

MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS

  • Sigrún Andradóttir (a1), Hayriye Ayhan (a1) and Douglas G. Down (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.