Bottlenecks in production networks: An overview

Abstract

Bottlenecks, the key ingredients for improving the performances of the production networks, have been profoundly studied during the last decade. Yet, because of the complexity of the research results, there is still a significant gap between theory and practice. In this paper, we review various bottleneck definitions, detection methods and the asymptotic results and provide a practical guidance for recognizing and utilizing the bottlenecks in production networks. Queueing theory works as the mathematical foundation in our study. Various definitions of the bottlenecks are classified as either Performance in Processing (PIP) based or sensitivity based definitions, which reflect the preferences of the managers. Detection methods are surveyed closely based on the definitions. These methods are used to recognize the bottlenecks and to provide diagnosis results to managers. Comparisons show that different detection methods may lead to vastly different conclusions. The recognition of the bottlenecks has another advantage: the ultimate phenomena of the bottlenecks can greatly reduce the computation complexity in calculating the system performances. Bottlenecks based approximation and asymptotic results are studied to exhibit the contribution of bottlenecks in performance estimation and theoretical analysis.

Keywords

Bottleneck definition / bottleneck detection method / asymptotic result / queueing theory / production network

References

[1] Balbo G., Serazzi G.. Asymptotic analysis of multiclass closed queueing networks: common bottleneck. Performance Evaluation, 1996, 26(1): 51-72.

[2] Balbo G., Serazzi G.. Asymptotic analysis of multiclass closed queueing networks: multiple bottlenecks. Performance Evaluation, 1997, 30(3): 115-152.

[3] Berger A., Bregman L., et al. Bottleneck analysis in multiclass closed queueing networks and its application. Queueing Systems, 1999, 31(3–4): 217-237.

[4] Bolch G., S. Greiner, et. al., Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications, John Wiley and Sons, 1998.

[5] Bukchin J.. A comparative study of performance measures for throughput of a mixed model assembly line in a JIT environment. International Journal of Production Research, 1998, 36(10): 2669-2685.

[6] Casale G., G. Serazzi, “Estimating bottlenecks of very large models”, Performance Evaluation Stories and Perspectives-G.Kotsis Editor, Austrian Computing Society, pp89–104, 2003.

[7] Casale G., G. Serazzi, “Bottlenecks identification in multiclass queueing networks using convex polytopes”, In Proc. IEEE/ACM MASCOTS 2004, IEEE Comp. Soc., pp223–230, 2004.

[8] Chen H., A. Mandelbaum, “Stochastic discrete flow networks: diffusion approximations and bottlenecks,”, Graduate School of Business, Stanford University, 1988.

[9] Chiang S. Y., Kuo C. T., et al. DT-bottlenecks in serial production lines: theory and application. IEEE Transctions on Robotics and Automation, 2000, 16(Issue5): 567-580.

[10] Chiang S. Y., Kuo C. T., et al. Bottlenecks in Markovian production lines: a systems approach. IEEE Transactions on Robotics and Automation, 1998, 14(Issue2): 352-359.

[11] Chiang S. Y., Kuo C. T., et al. c-bottlenecks in serial production lines: identification and application. Proceedings of the 38th IEEE Conference on Decision and Control, 1999, 1: 456-461.

[12] Chiang S. Y., Kuo C. T., et al. Bottlenecks in Markovian production lines: identification and application. Proceedings of the 37th IEEE Conference on Decision and Control, 1999, 4: 4348-4349.

[13] Cox F. J., Spencer M. S.. The Constraints Management Handbook, 1997, Boca Raton, Florida: CRC Press — St. Lucie Press

[14] Dai J. G.. Sequential bottleneck decomposition: an approximation method for generalized Jackson networks. Operations Research, 1994, 42(1): 119-136.

[15] Dai J. G., Harrison J. M.. The QNET method for two moment analysis of closed manufacturing systems. Annals of Applied Probability, 1993, 3: 968-1012.

[16] Delp D., J. Si, Y. Hwang, et. al., “A dynamic system regulation measure for increasing effective capacity: the X-factor theory”, Advanced Semiconductor Manufacturing Conference and Workshop, pp81–88, 2003.

[17] Elmasry G. F., C. John, et. al., “Bottleneck discovery in large scale network based on the expected value of per-hop delay”, Tech. Report, 2000.

[18] Harrison P., Coury S.. On the asymptotic behaviour of closed multiclass queueing networks. Performance Evaluation, 2002, 47(2–3): 131-138.

[19] Harrison J. M., Nguyen V.. The QNET method for two moment analysis of open queueing networks. Queueing Systems, 1990, 6: 1-32.

[20] Iglehart D. L., Whitt W.. Multiple channel queues in heavy traffic, ii: sequences, networks, and batches. Adv. Appl. Prob., 1970, 2: 355-369.

[21] Jibiki M., T. Terano et. al., “Comprehensive bottleneck detection via nonlinear optimization techniques”, Internet Workshop IWS, pp286–293, 1999.

[22] Katabi D., I. Bazzi et. al., “A passive approach for detecting shared bottlenecks”, In Proc. International Conference on Computer Communications and Networks, 2001.

[23] Knessl C., Tier C.. Asymptotic approximations and bottleneck analysis in product form queueing networks with large populations. Performance Evaluation, 1998, 33: 219-248.

[24] Kuo C. T., Lim J. T., et al. Bottlenecks in serial production lines: a system-theoretic approach. Mathematical Problems in Engineering, 1996, 2: 233-276.

[25] Law A. M., D. W. Kelton, Simulation Modeling and Analysis. McGraw Hill, 1991.

[26] Lawrence S. R., Buss A. H.. Economic analysis of production bottlenecks. Mathematical Problems in Engineering, 1995, 1(4): 341-369.

[27] Luthi J., “Interval matrices for the bottleneck analysis of queueing network models with histogram-based parameters”, In IEEE International Computer Performance and Dependability Symposium, Durham, NC, USA, pp142–151, 1998.

[28] Luthi J., G. Haring, “Bottleneck analysis for computer and communication systems with workload variabilities and uncertainties”, In Proc. of 2nd Intl Symposium on Mathematical Modelling, pp525–534, 1997.

[29] Pollett P. K.. Modelling congestion in closed queueing networks. International Transactions in Operations Research, 2000, 7: 319-330.

[30] Reiman M. I.. Some diffusion approximations with state-space collapse. Proc. Int. Seminar on Modeling and Perf. Eval. Methodology, 1983, Berlin: Springer-Verlag 209-240.

[31] Reiman M. I.. Open queueing networks in heavy traffic. Math. Oper. Res., 1984, 9: 441-458.

[32] Roser C., M. Nakano et. al., “A practical bottleneck detection method”, Proceedings of the 2001 Winter Simulation Conference, pp. 949–953, 2001.

[33] Roser C., M. Nakano et. al., “Comparison of bottleneck detectioni methods for AGV systems”, Proceedings of the 2003 Winter Simulation Conference, pp1192–1198, 2003.

[34] Roser C., M. Nakano et. al., “Shifting bottleneck detection”, In Winter Simulation Conference, San Diego, CA, USA. pp1079–1086, 2002.

[35] Roser C., M. Nakano et. al., “Tracking Shifting Bottlenecks”, In Japan-USA Symposium on Flexible Automation, Hiroshima, Japan, pp745–750, 2002.

[36] Roser C., Nakano M., et al. Throughput sensitivity analysis using a single simulation. Simulation Conference Proceedings of the Winter, 2002, 2: 1087-1094.

[37] Roser C., Nakano M., et al. Shifting bottleneck detection. Simulation Conference Proceedings of the Winter, 2002, 2: 1079-1086.

[38] Schweitzer P. J., G. Serazzi, et. al., “A survey of bottleneck analysis in closed network of queues”, Perf. Eval. of Computer and Communication Systems, Joint Tutorial Papers of Performance 93 and Sigmetrics, Springer-Verlag, pp491–508, 1993.

[39] Suresh S., Whitt W.. The heavy-traffic bottleneck phenomenon in open queueing networks. Operations Research Letters, 1990, 9(6): 355-362.

[40] Wang J., Chen R., et al. Bottleneck analysis and maximum yield solution for a classof production process. IEEE International Conference on Intelligent Processing Systems, 1997, 2: 1361-1365.

[41] Whitt W.. The queueing networks analyzer. Bell Sys. Tech. J., 1991, 62: 2779-2815.