Skip to main content Accessibility help
×
Home

Optimal stochastic scheduling of a two-stage tandem queue with parallel servers

  • Hyun-Soo Ahn (a1), Izak Duenyas (a1) and Rachel Q. Zhang (a1)

Abstract

We consider the optimal stochastic scheduling of a two-stage tandem queue with two parallel servers. The servers can serve either queue at any point in time and the objective is to minimize the total holding costs incurred until all jobs leave the system. We characterize sufficient and necessary conditions under which it is optimal to allocate both servers to the upstream or downstream queue. We then conduct a numerical study to investigate whether the results shown for the static case also hold for the dynamic case. Finally, we provide a numerical study that explores the benefits of having two flexible parallel servers which can work at either queue versus servers dedicated to each queue. We discuss the results' implications for cross-training workers to perform multiple tasks.

Copyright

Corresponding author

Postal address: Department of Industrial and Operations Engineering, The University of Michigan, 1205 Beal Avenue, Ann Arbor, MI 48109-2117, USA.
∗∗ Email address: duenyas@umich.edu

References

Hide All
[1] Agrawal, R., Hedge, M. and Teneketzis, D. (1990). Multi-armed bandit problems with multiple plays and switching costs. Stochastics and Stochastic Reports 29, 437–359.
[2] Bartholdi, J. J., Bunimovich, L. A. and Eisenstein, D. (1995). Dynamics of 2 and 3-worker bucket brigade production lines. Tech. Rep. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
[3] Chang, C., Nelson, R. and Pinedo, M. (1991). Scheduling two classes of exponential jobs on parallel processors: Structural results and worst-case analysis. Adv. Appl. Prob. 23, 925944.
[4] Duenyas, I., Gupta, D. and Olsen, T. (1998). Control of a single server tandem queueing system with setups. Operat. Res. 46, 218230.
[5] Farrar, T. (1993). Optimal use of an extra server in a two station tandem queueing network. IEEE Trans. Automat. Control 38, 12961299.
[6] Gittins, J. C. (1989). Multi-armed Bandit Allocation Indices. John Wiley, New York.
[7] Hajek, B. (1984). Optimal control of two interacting service stations. IEEE Trans. Automat. Control AC29, 491499.
[8] Hofri, M. and Ross, K. (1987). On the optimal control of two queues with server setup times and its analysis. SIAM J. Computing 16, 399420.
[9] Iravani, S. M. R., Posner, M. J. M. and Buzacott, J. A. (1995). Two-stage tandem queue attended by a moving server with holding and switching costs; static and semi-dynamic policy. Tech. Rep. 95-18, University of Toronto, Department of Industrial Engineering, Toronto, Canada.
[10] Iravani, S. M. R., Posner, M. J. M. and Buzacott, J. A. (1996). An N-stage tandem queueing system attended by a moving server with holding and switching costs. Tech. Rep., 96-09, University of Toronto, Department of Industrial Engineering, Toronto, Canada.
[11] Kampke, T. (1987). On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Prob. 24, 430448.
[12] Kampke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel processors. Operat. Res. 37, 126133.
[13] McClain, J. O., Thomas, L. J. and Schultz, K. (1997). Management of worksharing systems. Tech. Rep. S.C. Johnson Graduate School of Management, Cornell University, New York. To appear in Manufacturing and Service Operations Management.
[14] Van Oyen, M. and Teneketzis, D. (1992). Optimal scheduling of a finite capacity shuttle under delayed information. Prob. Eng. Inf. Sci. 6, 2961.
[15] Van Oyen, M. and Tenektzis, D. (1994). Optimal stochastic scheduling of forest networks with switching penalties. Adv. Appl. Prob. 26, 474497.
[16] Van Oyen, M. and Teneketzis, D. (1996). Optimal batch services for a polling system under partial information. ZOR: Meth. Models Op. Res. 44, 401419.
[17] Pandelis, D. and Teneketzis, D. (1994a). Optimal multiserver stochastic scheduling of two interconnected priority queues. Adv. Appl. Prob. 26, 258279.
[18] Pandelis, D. and Teneketzis, D. (1994b). Optimal stochastic dynamic scheduling in multi-class queues with tardiness and/or earliness penalties. Prob. Eng. Inf. Sci. 8, 491509.
[19] Pinedo, M. (1995). Scheduling: Theory, Algorithms and Systems. Prentice Hall, Princeton, NJ.
[20] Rosberg, Z., Varaiya, P. and Walrand, J. (1982). Optimal control of service in tandem queues. IEEE Trans. Automat. Control. AC27, 600609.
[21] Ross, S. (1983). Introduction to Stochastic Dynamic Programming. Academic Press, New York.
[22] Stidham, S. and Weber, R. (1993). A survey of Markov decision models for control of networks of queues. QSTA 13, 291314.
[23] Weber, R. and Stidham, S. (1987). Optimal control of service rates in networks of queues. Adv. Appl. Prob. 19, 202217.

Keywords

MSC classification

Optimal stochastic scheduling of a two-stage tandem queue with parallel servers

  • Hyun-Soo Ahn (a1), Izak Duenyas (a1) and Rachel Q. Zhang (a1)

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