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

References

• Bassamboo A, Randhawa RS, Zeevi A (2010) Capacity sizing under parameter uncertainty: Safety staffing principles revisited. Management Sci. 56(10):1668–1686.Link, Google Scholar
• Brucker P, Drexl AM, Möhring RM, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1):3–41.Crossref, Google Scholar
• Chan CW, Escobar G, Yom-Tov G (2014) When to use speedup: An examination of service systems with returns. Oper. Res. 62(2):462–482.Link, Google Scholar
• Chopra S, Savaskan-Ebert RC (2013) Case weight solutions clinic: Bariatric surgery. Case 5-104-006, Kellogg Case Publishing, Northwestern University, Evanston, IL.Google Scholar
• Dai JG (1999) Stability of fluid and stochastic processing networks (MaPhySto Miscellanea 9), Centre for Mathematical Physics and Stochastics, University of Aarhus, Aarhus, Denmark.Google Scholar
• Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
• Dobson G, Karmarkar US (1989) Simultaneous resource scheduling to minimize weighted flow times. Oper. Res. 37(4):592–600.Link, Google Scholar
• Graves SC, Tomlin BT (2003) Process flexibility in supply chains. Management Sci. 49(7):907–919.Link, Google Scholar
• Harrison JM (2002) Stochastic networks and activity analysis. Suhov Y, ed. Analytic Methods in Applied Probability, in Memory of Fridrikh Karpelevich (American Mathematical Society, Providence, RI).Crossref, Google Scholar
• Haviv M (2013) Queues: A Course in Queueing Theory (Springer, New York).Crossref, Google Scholar
• Herroelen W, De Reyck B, Demeulemeester E (1998) Resource-constrained project scheduling: A survey of recent developments. Comput. Oper. Res. 25(4):279–302.Crossref, Google Scholar
• Jiang L, Walrand J (2010) Scheduling and congestion control for wireless and processing networks. Synthesis Lectures on Communication Networks 3(1):1–156.Crossref, Google Scholar
• Kelly FP (1991) Loss networks. Ann. Appl. Probab. 1(3):318–378.Crossref, Google Scholar
• Massoulie L, Roberts JW (2000) Bandwidth sharing and admission control for elastic traffic. Telecommunication Systems 15(1–2):185–201.Crossref, Google Scholar
• Reiman M, Wein L (1998) Dynamic scheduling of a two-class queue with setups. Oper. Res. 46(4):532–547.Link, Google Scholar
• Roels G, Karmarkar US, Carr S (2010) Contracting for collaborative services. Management Sci. 56(5):849–863.Link, Google Scholar
• Schrijver A (1998) Theory of Linear and Integer Programming (Wiley, New York).Google Scholar
• Shah D, Wischik D (2012) Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. Ann. Appl. Probab. 22(1):70–127.Crossref, Google Scholar
• Stolyar AL, (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.Crossref, Google Scholar
• Tassiulas L, Ephremides A (1992) Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. Automatic Control, IEEE Trans. 37(12):1936–1948.Crossref, Google Scholar
• Van Mieghem JA (2008) Pizza Pazza. Available from [email protected].Google Scholar
• Williams RJ (1998) Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Systems 30(1–2):27–88.Crossref, Google Scholar
• Zachary S, Ziedins I (1999) Loss networks and Markov random fields. J. Appl. Probab. 36(2):403–414.Crossref, Google Scholar