Abstract
We consider a queueing system with multiple stations attended by a single flexible server. An order arriving at this system needs to go through each station only once but there is no particular precedence relationship among these stations. One can also think of this system as an assembly system where each station processes a different component of an order and once all the components associated with an order are processed they are assembled instantaneously. A holding cost is charged for keeping the orders in the system and there is a penalty associated with the switches of the server between stations. Our objective is to minimize the long-run average costs by dynamically assigning the server to stations based on the system state. Using sample-path arguments, we provide partial characterizations of the optimal policy and provide sufficient conditions under which a simple state-independent policy that works on one order at a time is optimal. We also propose three simple threshold policies and present a numerical study that provides supporting evidence for the superior performance of our double-threshold heuristic.
Similar content being viewed by others
References
Altman, E., Konstantopoulos, P., Liu, Z.: Stability, monotonicity, and invariant quantities in general polling systems. Queueing Syst. 11, 35–57 (1992)
Andradóttir, S., Ayhan, H., Down, D.G.: Dynamic server allocation for queueing networks with flexible servers. Oper. Res. 51, 952–968 (2003)
Andradóttir, S., Ayhan, H., Down, D.G.: Compensating for failures with flexible servers. Oper. Res. 55, 753–768 (2007)
Andradóttir, S., Ayhan, H., Kırkızlar, E.: Flexible servers in tandem lines with setup costs. Queueing Syst. (2011). doi:10.1007/s11134-011-9263-9
Boxma, O.J., Levy, H., Weststrate, J.A.: Efficient visit frequencies for polling tables: Minimization of waiting cost. Queueing Syst. 9, 133–162 (1991)
Buyukkoc, C., Varaiya, P., Walrand, J.: The cμ-rule revisited. Adv. Appl. Probab. 17, 237–238 (1985)
Duenyas, I., Gupta, D., Olsen, T.L.: Control of a single-server tandem queueing system with setups. Oper. Res. 46, 218–230 (1998)
Duenyas, I., Van Oyen, M.P.: Stochastic scheduling of parallel queues with set-up costs. Queueing Syst. 19, 421–444 (1995)
Duenyas, I., Van Oyen, M.P.: Heuristic scheduling of parallel heterogeneous queues with set-ups. Manag. Sci. 42, 814–829 (1996)
Harrison, J.M.: Assembly-like queues. J. Appl. Probab. 10, 354–367 (1973)
Hofri, M., Ross, K.W.: On the optimal control of two queues with server setup times and its analysis. SIAM J. Comput. 16, 399–420 (1987)
Hopp, W.J., Van Oyen, M.P.: Agile workforce evaluation: a framework for cross-training and coordination. IIE Trans. 36, 919–940 (2004)
Iravani, S.M.R.: Design and control principles of flexible workforce in manufacturing systems. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science, pp. 1309–1325. Wiley, New York (2011)
Iravani, S.M.R., Buzacott, J.A., Posner, M.J.M.: Operations and shipment scheduling of a batch on a flexible machine. Oper. Res. 51, 585–601 (2003)
Iravani, S.M.R., Posner, M.J.M., Buzacott, J.A.: A two-stage tandem queue attended by a moving server with holding and switching costs. Queueing Syst. 26, 203–228 (1997)
Iravani, S.M.R., Teo, C.P.: Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. Oper. Res. Lett. 33, 421–430 (2005)
Koole, G.: Assigning a single server to inhomogeneous queues with switching costs. Theor. Comput. Sci. 182, 203–216 (1997)
Liu, Z., Nain, P., Towsley, D.: On optimal polling policies. Queueing Syst. 11, 59–83 (1992)
Mayorga, M.E., Taaffe, K.M., Arumugam, R.: Allocating flexible servers in serial systems with switching costs. Ann. Oper. Res. 172, 231–242 (2009)
Powell, S.G., Pyke, D.F.: Buffering unbalanced assembly systems. IIE Trans. 30, 55–65 (1998)
Reiman, M.I., Wein, L.M.: Dynamic scheduling of a two-class queue with setups. Oper. Res. 46, 532–547 (1998)
Sennott, L.I., Van Oyen, M.P., Iravani, S.M.R.: Optimal dynamic assignment of a flexible worker on an open production line with specialists. Eur. J. Oper. Res. 170, 541–566 (2006)
Tsai, Y-.C., Argon, N.T.: Dynamic server assignment policies for assembly-type queues with flexible servers. Nav. Res. Logist. 55, 234–251 (2008)
Van Mieghem, J.: Dynamic scheduling with convex delay costs. Ann. Appl. Probab. 5, 809–833 (1995)
Van Oyen, M.P., Teneketzis, D.: Optimal stochastic scheduling of forest networks with switching penalties. Adv. Appl. Probab. 26, 474–497 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tanık Argon, N., Tsai, YC. Dynamic control of a flexible server in an assembly-type queue with setup costs. Queueing Syst 70, 233–268 (2012). https://doi.org/10.1007/s11134-011-9269-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-011-9269-3