Hostname: page-component-89b8bd64d-b5k59 Total loading time: 0 Render date: 2026-05-07T12:02:41.245Z Has data issue: false hasContentIssue false
  • English
  • Français

DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES

Published online by Cambridge University Press:  22 October 2007

Sigrún Andradóttir ,
Hayriye Ayhan  and
Douglas G. Down
Sigrún Andradóttir
Affiliation:
H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of TechnologyAtlanta, GA 30332-0205 E-mail: hayhan@isye.gatech.edu
Hayriye Ayhan
Affiliation:
H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of TechnologyAtlanta, GA 30332-0205 E-mail: hayhan@isye.gatech.edu
Douglas G. Down
Affiliation:
Department of Computing and SoftwareMcMaster University Hamilton, Ontario L8S 4L7, Canada
Get access Rights & Permissions [Opens in a new window]

Abstract

Consider a system of queuing stations in tandem having both flexible servers (who are capable of working at multiple stations) and dedicated servers (who can only work at the station to which they are dedicated). We study the dynamic assignment of servers to stations in such systems with the goal of maximizing the long-run average throughput. We also investigate how the number of flexible servers influences the throughput and compare the improvement that is obtained by cross-training another server (i.e., increasing flexibility) with the improvement obtained by adding a resource (i.e., a new server or a buffer space). Finally, we show that having only one flexible server is sufficient for achieving near-optimal throughput in certain systems with moderate to large buffer sizes (the optimal throughput is attained by having all servers flexible). Our focus is on systems with generalist servers who are equally skilled at all tasks, but we also consider systems with arbitrary service rates.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 21 , Issue 4 , October 2007 , pp. 497 - 538
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Ahn, H.-S., Duenyas, I., & Lewis, M.E. (2002). The optimal control of a two-stage tandem queueing system with flexible servers. Probability in the Engineering and Informational Sciences 16: 453–469.CrossRefGoogle Scholar
2.Ahn, H-S., Duenyas, I., & Zhang, R. (1999). Optimal scheduling of a 2-stage tandem queue with parallel servers. Advances in Applied Probability 31: 1095–1117.CrossRefGoogle Scholar
3.Ahn, H.-S., Duenyas, I., & Zhang, R. (2004). Optimal control of a flexible server. Advances in Applied Probability 36: 139–170.CrossRefGoogle Scholar
4.Ahn, H.-S. & Righter, R. (2006). Dynamic load balancing with flexible workers. Advances in Applied Probability 38: 621–642.CrossRefGoogle Scholar
5.Andradóttir, S. & Ayhan, H. (2005). Throughput maximization for tandem lines with two stations and flexible servers. Operations Research 53: 516–531.CrossRefGoogle Scholar
6.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: 1421–1439.Google Scholar
7.Andradóttir, S., Ayhan, H., & Down, D.G. (2003). Dynamic server allocation for queueing networks with flexible servers. Operations Research 51: 952–968.Google Scholar
8.Andradóttir, S., Ayhan, H., & Down, D.G. (2007). Compensating for failures with flexible servers. Operations Research (to appear).CrossRefGoogle Scholar
9.Bartholdi, J.J. & Eisenstein, D.D. (1996). A production line that balances itself. Operations Research 44(1): 21–34.CrossRefGoogle Scholar
10.Bartholdi, J.J., Eisenstein, D.D., & Foley, R.D. (2001). Performance of bucket brigades when work is stochastic. Operations Research 49: 710–719.CrossRefGoogle Scholar
11.Bell, S.L. & Williams, R.J. (2001). Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy. Annals of Applied Probability 11: 608–649.CrossRefGoogle Scholar
12.Bell, S.L. & Williams, R.J. (2005). Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic Journal of Probability 10: 1044–1115.Google Scholar
13.Farrar, T.M. (1993). Optimal use of extra server in a two station tandem queueing network. IEEE Transactions on Automatic Control 38(8): 196–199.CrossRefGoogle Scholar
14.Gurumurthi, S. & Benjaafar, S. (2004). Modeling and analysis of flexible queueing systems. Naval Research Logistics 51: 755–782.Google Scholar
15.Hajek, B. (1984). Optimal control of interacting service stations. IEEE Transactions on Automatic Control 29(6): 491–499.Google Scholar
16.Harrison, J.M. & López, M.J. (1999). Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33: 339–368.CrossRefGoogle Scholar
17.Hopp, W.J., Tekin, E., & van Oyen, M.P. (2004). Benefits of skill chaining in serial production lines with cross-trained workers. Management Science 50: 83–98.CrossRefGoogle Scholar
18.Hopp, W.J. & van Oyen, M.P. (2004). Agile workforce evaluation: A framework for cross-training and coordination. IIE Transactions 36: 919–940.CrossRefGoogle Scholar
19.Jordan, W.J. & Graves, S.C. (1995). Principles on the benefits of manufacturing process flexibility. Management Science 41: 577–594.CrossRefGoogle Scholar
20.Kaufman, D.L., Ahn, H-S., & Lewis, M.E. (2005). On the introduction of an agile, temporary workforce into a tandem queueing system. Queueing Systems: Theory and Applications 51: 135–171.CrossRefGoogle Scholar
21.Mandelbaum, A. & Stolyar, A.L. (2002). Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Operations Research 52: 836–855.CrossRefGoogle Scholar
22.McClain, J.O., Thomas, L.J., & Sox, C. (1992). On-the-fly line balancing with very little WIP. International Journal of Production Economics 27: 283–289.CrossRefGoogle Scholar
23.Ostalaza, J., McClain, J., & Thomas, L.J. (1990). The use of dynamic programming (state-dependent) assembly line balancing to improve throughput. Journal of Manufacturing Operations Management 3: 105–133.Google Scholar
24.Pandelis, D.G. & Teneketsiz, D. (1994). Optimal multiserver stochastic scheduling of two interconnected priority queues. Advances in Applied Probability 26: 258–279.Google Scholar
25.Puterman, M.L. (1994). Markov decision processes. New York: Wiley.CrossRefGoogle Scholar
26.Rosberg, Z., Varaiya, P.P., & Walrand, J.C. (1982). Optimal control of service in tandem queues. IEEE Transactions on Automatic Control 27(3): 600–609.CrossRefGoogle Scholar
27.Sheikhzadeh, M., Benjaafar, S., & Gupta, D. (1998). Machine sharing in manufacturing systems: Flexibility versus chaining. International Journal of Flexible Manufacturing Systems 10: 351–378.CrossRefGoogle Scholar
28.Squillante, M.S., Xia, C.H., Yao, D.D., & Zhang, L. (2001). Threshold based priority policies for parallel-server systems with affinity scheduling. In Proceedings of the 2001 American Control Conference, pp. 2992–2999.Google Scholar
29.Tassiulas, L. & Bhattacharya, L.L. (2000). Allocation of interdependent resources for maximal throughput. Stochastic Models 16: 27–48.CrossRefGoogle Scholar
30.Wang, Y., Perkins, J.R., Vakili, P., & Khurana, A. (2001). Optimal allocation of heterogeneous resources: A control theoretic approach. In Proceedings of the 40th IEEE Conference on Decision and Control, pp. 1953–1958.Google Scholar
31.Wu, C.-H., Down, D.G., & Lewis, M.E. (2005). Heuristics for allocation of reconfigurable resources in a serial line with reliability considerations. Preprint.Google Scholar
32.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: 309–314.Google Scholar
33.Zavadlav, E., McClain, J.O., & Thomas, L.J. (1996). Self-buffering, self-balancing, self-flushing production lines. Management Science 42(8): 1151–1164.CrossRefGoogle Scholar