On the Structure of Bottlenecks in Processes

References

• Abadi IK , Hall NG , Sriskandarajah C (2000) Minimizing cycle time in a blocking flowshop. Oper. Res. 48(1):177–180.Link, Google Scholar
• Alcaide D , Chu C , Kats V , Levner E , Sierksma G (2007) Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. Eur. J. Oper. Res. 177(1):147–162.Crossref, Google Scholar
• Alfonsin JLR (2001) Perfect Graphs (John Wiley & Sons, New York).Google Scholar
• Anupindi R , Deshmukh S , Van Mieghem JA , Zemel E (2012) Managing Business Process Flows , 3rd ed. (Pearson, London).Google Scholar
• Bertsimas D , Chryssikou T (1999) Bounds and policies for dynamic routing in loss networks. Oper. Res. 47(3):379–394.Link, Google Scholar
• Bo Y , Dawande M , Huh T , Janakiraman G , Nagarajan M (2018) Determining process capacity: Intractability and efficient special cases. Manufacturing Service Oper. Management 21(1):16–33.Google Scholar
• Chudnovsky M , Roberson N , Seymour PD , Thomas R (2006) The strong perfect graph theorem. Ann. Math. (2) 164(1):51–229.Crossref, Google Scholar
• Chudnovsky M , Cornuéjols G , Liu X , Seymour P , Vusković K (2005) Recognizing Berge graphs. Combinatorica 25(2):143–186.Crossref, Google Scholar
• Chvatal V (1979) A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3):233–235.Link, Google Scholar
• Crama Y , Van De Klundert J (1997) Cyclic scheduling of identical parts in a robotic cell. Oper. Res. 45(6):952–965.Link, Google Scholar
• Dai JG , Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
• Dawande M , Sriskandarajah C , Sethi S (2002) On throughput maximization in constant travel-time robotic cells. Manufacturing Service Oper. Management 4(4):296–312.Link, Google Scholar
• Dawande M , Geismar HN , Sethi SP , Sriskandarajah C (2007) Throughput Optimization in Robotic Cells, International Series in Operations Research and Management Science, vol. 101 (Springer US, New York).Google Scholar
• Debels D , Vanhoucke M (2007) A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Oper. Res. 55(3):457–469.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
• Dorndorf U , Pesch E , Phan-Huy T (2000) A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints. Management Sci. 46(10):1365–1384.Link, Google Scholar
• Edmonds J , Giles R (1984) Total dual integrality of linear inequality systems. Pulleyblank WR, ed. Progress in Combinatorial Optimization (Academic Press, Toronto), 117–129.Google Scholar
• Godsil C , Royle G (2001) Algebraic Graph Theory (Springer-Verlag, New York).Crossref, Google Scholar
• Golumbic MC (2004) Algorithmic Graph Theory and Perfect Graphs , Annals of Discrete Mathematics, vol. 57 (North Holland, Amsterdam).Crossref, Google Scholar
• Grötschel M , Lovász L , Schrijver A (2012) Geometric Algorithms and Combinatorial Optimization (Springer Science & Business Media, Berlin).Google Scholar
• Gurvich I , Van Mieghem JA (2015) Collaboration and multitasking in networks: Architectures, bottlenecks, and capacity. Manufacturing Service Oper. Management 17(1):16–33.Link, Google Scholar
• Gurvich I , Van Mieghem JA (2017) Collaboration and multitasking in networks: Prioritization and achievable capacity. Management Sci. 64(5):2390–2406.Link, Google Scholar
• Harrison JM (2000) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1):75–103.Crossref, Google Scholar
• Harrison JM (2002) Stochastic networks and activity analysis. Suhov YM , ed. Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich, American Mathematical Society Translations Series 2, vol. 207 (American Mathematical Society, Providence, RI), 53–76.Google Scholar
• Harrison JM (2003) A broader view of Brownian networks. Ann. Appl. Probab. 13(3):1119–1150.Crossref, Google Scholar
• Hartmann S , Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1):1–14.Crossref, Google Scholar
• Jiang L , Walrand J (2010) Scheduling and congestion control for wireless and processing networks. Synthesis Lectures Communication Networks 3(1):1–156.Crossref, Google Scholar
• Jung K , Lu Y , Shah D , Sharma M , Squillante MS (2019) Revisiting stochastic loss networks: Structures and approximations. Math. Oper. Res. 44(3):890–918.Link, Google Scholar
• Kelly FP (1991) Loss networks. Ann. Appl. Probab. 1(3):319–378.Crossref, Google Scholar
• Lee TE , Posner ME (1997) Performance measures and schedules in periodic job shops. Oper. Res. 45(1):72–91.Link, Google Scholar
• Levner E , Kats V (1998) A parametric critical path problem and an application for cyclic scheduling. Discrete Appl. Math. 87(1):149–158.Crossref, Google Scholar
• Levner E , Kats V , Alcaide López de Pablo D , Cheng TCE (2010) Complexity of cyclic scheduling problems: A state-of-the-art survey. Comput. Indust. Engrg. 59(2):352–361.Crossref, Google Scholar
• Lovász L (1972) Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(3):253–267.Crossref, Google Scholar
• Lund C , Yannakakis M (1994) On the hardness of approximating minimization problems. J. ACM 41(5):960–981.Crossref, Google Scholar
• Matsuo H , Shang JS , Sullivan RS (1991) A crane scheduling problem in a computer-integrated manufacturing environment. Management Sci. 37(5):587–606.Link, Google Scholar
• McCormick ST , Pinedo ML , Shenker S , Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper. Res. 37(6):925–935.Link, Google Scholar
• Möhring RH , Schulz AS , Stork F , Uetz M (2003) Solving project scheduling problems by minimum cut computations. Management Sci. 49(3):330–350.Link, Google Scholar
• Roundy R (1992) Cyclic schedules for job shops with identical jobs. Math. Oper. Res. 17(4):842–865.Link, Google Scholar
• Scheinerman E , Ullman D (2011) Fractional Graph Theory: A Rational Approach to the Theory of Graphs (Courier Corporation, North Chelmsford, MA).Google Scholar
• Schrijver A (1998) Theory of Linear and Integer Programming , Wiley Series in Discrete Mathematics and Optimization (John Wiley & Sons, Chichester, UK).Google Scholar
• Slavik P (1997) A tight analysis of the greedy algorithm for set cover. J. Algorithms 25(2):237–254.Crossref, Google Scholar
• Wang S , Su H , Wan G (2015) Resource-constrained machine scheduling with machine eligibility restriction and its applications to surgical operations scheduling. J. Combinatorial Optim. 30(4):982–995.Crossref, Google Scholar