Maximizing throughput in queueing networks with limited flexibility

Abstract We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are serviced by a set of flexible servers, i.e., a server is capable of serving more than one class of customers and the sets of classes that the servers are capable of serving may overlap. We would like to choose an assignment of servers that achieves the maximal capacity of the given queueing network, where the maximal capacity is λ∗ if the network can be stabilized for all arrival rates λ   λ∗. We examine the situation where there is a restriction on the number of servers that are able to serve a class, and reduce the maximal capacity objective to a maximum throughput allocation problem of independent interest: the total discrete capacity constrained problem (TDCCP). We prove that solving TDCCP is in general NP-complete, but we also give exact or approximation algorithms for several important special cases and discuss the implications for building limited flexibility into a system.

[1]  L. Tassiulas,et al.  Allocation of interdependent resources for maximal throughput , 2000 .

[2]  Sean P. Meyn,et al.  Stability of Generalized Jackson Networks , 1994 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  George Karakostas,et al.  Maximizing Throughput in Queueing Networks with Limited Flexibility , 2006, LATIN.

[5]  Saifallah Benjaafar,et al.  Machine Sharing in Manufacturing Systems: Total Flexibility versus Chaining , 1998 .

[6]  Clifford Stein,et al.  Approximation Algorithms for Single-Source Unsplittable Flow , 2001, SIAM J. Comput..

[7]  Mor Armony,et al.  Queueing networks with interacting service resources , 1999 .

[8]  Mark S. Squillante,et al.  Threshold-based priority policies for parallel-server systems with affinity scheduling , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[9]  Michael Rubinovitch,et al.  The slow server problem: a queue with stalling , 1984, Journal of Applied Probability.

[10]  Diwakar Gupta,et al.  Machine Sharing in Manufacturing Systems : Flexibility versus Chaining , 1997 .

[11]  Sigrún Andradóttir,et al.  Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems , 2001, Manag. Sci..

[12]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[13]  Sigrún Andradóttir,et al.  Dynamic Server Allocation for Queueing Networks with Flexible Servers , 2003, Oper. Res..

[14]  Frederick S. Hillier,et al.  On the Simultaneous Optimization of Server and Work Allocations in Production Line Systems with Variable Processing Times , 1996, Oper. Res..

[15]  J. G. Dai,et al.  Maximum Pressure Policies in Stochastic Processing Networks , 2005, Oper. Res..

[16]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1999, Comb..

[17]  John O. McClain,et al.  Self-buffering, self-balancing, self-flushing production lines , 1996 .

[18]  William C. Jordan,et al.  Principles on the benefits of manufacturing process flexibility , 1995 .

[19]  Ward Whitt,et al.  A Staffing Algorithm for Call Centers with Skill-Based Routing , 2005, Manuf. Serv. Oper. Manag..

[20]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[21]  K. Sigman.  The stability of open queueing networks , 1990 .

[22]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[23]  Wallace J. Hopp,et al.  Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers , 2004, Manag. Sci..

[24]  Sigrún Andradóttir,et al.  Throughput Maximization for Tandem Lines with Two Stations and Flexible Servers , 2005, Oper. Res..

[25]  Saif Benjaafar,et al.  Modeling and analysis of flexible queueing systems , 2004 .

[26]  Diane P. Bischak.  Performance of a manufacturing module with moving workers , 1996 .

[27]  Wallace J. Hopp,et al.  Agile workforce evaluation: a framework for cross-training and coordination , 2004 .

[28]  Martin Skutella,et al.  The k-Splittable Flow Problem , 2005, Algorithmica.