Collaboration and Multitasking in Networks: Architectures, Bottlenecks, and Capacity

M by the trend toward more collaboration in work flows, we study networks where some activities require the simultaneous processing by multiple types of multitasking human resources. Collaboration imposes constraints on the capacity of the process because multitasking resources have to be simultaneously at the right place. We introduce the notions of collaboration architecture and unavoidable bottleneck idleness to study the maximal throughput or capacity of such networks. Collaboration and multitasking introduce synchronization requirements that may inflict unavoidable idleness of the bottleneck resources: even when the network is continuously busy (processing at capacity), bottleneck resources can never be fully utilized. The conventional approach that equates network capacity with bottleneck capacity is then incorrect because the network capacity is below that of the bottlenecks. In fact, the gap between the two can grow linearly with the number of collaborative activities. Our main result is that networks with nested collaboration architectures have no unavoidable bottleneck idleness. Then, regardless of the processing times of the various activities, the standard bottleneck procedure correctly identifies the network capacity. We also prove necessity in the sense that, for any nonnested architecture, there are values of processing times for which unavoidable idleness persists. The fundamental trade-off between collaboration and capacity does not disappear in multiserver networks and has important ramifications to service-system staffing. Yet, even in multiserver networks, a nested collaboration architecture still guarantees that the bottleneck capacity is achievable. Finally, simultaneous collaboration, as a process constraint, may limit the benefits of flexibility. We study the interplay of flexibility and unavoidable idleness and offer remedies derived from collaboration architectures.

[1]  Stephen C. Graves,et al.  Process Flexibility in Supply Chains , 2003, Manag. Sci..

[2]  Itai Gurvich,et al.  Collaboration and Multitasking in Networks: Aligning Task Priorities and Collaboration Levels , 2015 .

[3]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[4]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[5]  Stan Zachary,et al.  Loss networks and Markov random fields , 1999 .

[6]  Devavrat Shah,et al.  Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse , 2010, ArXiv.

[7]  Jean C. Walrand,et al.  Scheduling and Congestion Control for Wireless and Processing Networks , 2010, Synthesis Lectures on Communication Networks.

[8]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Two-Class Queue with Setups , 2011, Oper. Res..

[9]  Itai Gurvich,et al.  Collaboration and Multitasking in Networks: Architectures, Bottlenecks, and Capacity , 2015 .

[10]  Carri W. Chan,et al.  When to Use Speedup: An Examination of Service Systems with Returns , 2014, Oper. Res..

[11]  Mario Vanhoucke,et al.  Resource-Constrained Project Scheduling , 2012 .

[12]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[13]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[14]  Ramandeep S. Randhawa,et al.  Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited , 2010, Manag. Sci..

[15]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[16]  Jiang Libin,et al.  Scheduling and Congestion Control for Wireless and Processing Networks , 2010 .

[17]  A. Stolyar MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

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

[19]  Moshe Haviv,et al.  Queues : A Course in Queueing Theory , 2013 .

[20]  J. Michael Harrison,et al.  Stochastic Networks and Activity Analysis , 2002 .

[21]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[22]  Sunil Chopra,et al.  Weight Solutions Clinic: Bariatric Surgery Center , 2013 .

[23]  Uday S. Karmarkar,et al.  Contracting for Collaborative Services , 2008, Manag. Sci..

[24]  Erik Demeulemeester,et al.  Resource-constrained project scheduling: A survey of recent developments , 1998, Comput. Oper. Res..

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

[26]  Uday S. Karmarkar,et al.  Simultaneous Resource Scheduling to Minimize Weighted Flow Times , 1989, Oper. Res..