Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 258173, 9 pages
http://dx.doi.org/10.1155/2014/258173
Research Article

A Bottleneck Detection Algorithm for Complex Product Assembly Line Based on Maximum Operation Capacity

Institute of CAPP & Manufacturing Engineering Software, Northwestern Polytechnical University, Xi’an 710072, China

Received 6 January 2014; Revised 4 March 2014; Accepted 5 March 2014; Published 19 May 2014

Academic Editor: Balaji Raghavan

Copyright © 2014 Dongping Zhao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. E. Betterton and S. J. Silver, “Detecting bottlenecks in serial production lines-a focus on interdeparture time variance,” International Journal of Production Research, vol. 50, no. 15, pp. 4158–4174, 2012. View at Publisher · View at Google Scholar
  2. Y. Hsiao, Y. Lin, and Y. Huang, “Optimal multi-stage logistic and inventory policies with production bottleneck in a serial supply chain,” International Journal of Production Economics, vol. 124, no. 2, pp. 408–413, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Li, “Bottleneck detection of complex manufacturing systems using a data-driven method,” International Journal of Production Research, vol. 47, no. 24, pp. 6929–6940, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Payne, N. Slack, and R. Wild, “A note on the operating characteristics of “balanced” and “unbalanced” production flow lines,” International Journal of Production Research, vol. 10, no. 1, pp. 93–98, 1972. View at Publisher · View at Google Scholar
  5. C. M. Liu and C. L. Lin, “Performance evaluation of unbalanced serial production lines,” International Journal of Production Research, vol. 32, no. 12, pp. 2897–2914, 1994. View at Publisher · View at Google Scholar
  6. S.-Y. Chiang, C.-T. Kuo, and S. M. Meerkov, “c-Bottlenecks in serial production lines: identification and application,” Mathematical Problems in Engineering, vol. 7, no. 6, pp. 543–578, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. L. Li, Q. Chang, and J. Ni, “Data driven bottleneck detection of manufacturing systems,” International Journal of Production Research, vol. 47, no. 18, pp. 5019–5036, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Lim, S. M. Meerkov, and F. Top, “Homogeneous, asymptotically reliable serial production lines: theory and a case study,” IEEE Transactions on Automatic Control, vol. 35, no. 5, pp. 524–534, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. J. C. Wang, M. C. Zhou, and Y. Deng, “Throughput analysis of discrete event systems based on stochastic Petri nets,” International Journal of Intelligent Systems, vol. 3, no. 3, pp. 343–358, 1999. View at Google Scholar
  10. A. M. Law and M. G. McComas, “Simulation of manufacturing systems,” in Proceedings of the 19th Winter Simulation Conference (WSC '98), pp. 49–52, December 1998. View at Scopus
  11. L. Li, “Bottleneck detection of complex manufacturing systems using a data-driven method,” International Journal of Production Research, vol. 47, no. 24, pp. 6929–6940, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Li, Q. Chang, J. Ni, G. Xiao, and S. Biller, “Bottleneck detection of manufacturing systems using data driven method,” in Proceedings of the IEEE International Symposium on Assembly and Manufacturing (ISAM '07), vol. 47, no 18, pp. 76–81, July 2007. View at Scopus
  13. L. Li, Q. Chang, J. Ni, and S. Biller, “Real time production improvement through bottleneck control,” International Journal of Production Research, vol. 47, no. 21, pp. 6145–6158, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. S. R. Lawrence and A. H. Buss, “Shifting production bottlenecks: causes, cures, and conundrums,” Production and Operations Management, vol. 3, no. 1, pp. 21–37, 1994. View at Google Scholar
  15. Y. Hsiao, Y. Lin, and Y. Huang, “Optimal multi-stage logistic and inventory policies with production bottleneck in a serial supply chain,” International Journal of Production Economics, vol. 124, no. 2, pp. 408–413, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. W. J. Hopp, M. L. Spearman, S. Chayet, K. L. Donohue, and E. S. Gel, “Using an optimized queueing network model to support wafer fab design,” IIE Transactions, vol. 34, no. 2, pp. 119–130, 2002. View at Publisher · View at Google Scholar · View at Scopus
  17. C. Roser, M. Nakano, and M. Tanaka, “A practical bottleneck detection method,” in Proceedings of the 33nd Conference on Winter Simulation, vol. 2, pp. 949–953, IEEE Computer Society, December 2001. View at Scopus
  18. C.-T. Kuo, J.-T. Lim, and S. M. Meerkov, “Bottlenecks in serial production lines: a system-theoretic approach,” Mathematical Problems in Engineering, vol. 2, no. 3, pp. 233–276, 1996. View at Publisher · View at Google Scholar · View at Scopus
  19. P. Faget, U. Eriksson, and F. Herrmann, “Applying discrete event simulation and an automated bottleneck analysis as an aid to detect running production constraints,” in Proceedings of the IEEE on Winter Simulation Conference, vol. 2005, pp. 1401–1407, December 2005. View at Publisher · View at Google Scholar · View at Scopus
  20. S. Sengupta, K. Das, and R. P. VanTil, “A new method for bottleneck detection,” in Proceedings of the 40th Conference on Winter Simulation, pp. 1741–1745, 2008.
  21. F. Z. Geng, S. P. Qian, and S. Li, “A numerical method for singularly perturbed turning point problems with an interior layer,” Journal of Computational and Applied Mathematics, vol. 255, pp. 97–105, 2014. View at Publisher · View at Google Scholar
  22. T. Leighton and S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” Journal of the ACM, vol. 46, no. 6, pp. 787–832, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. A. V. Goldberg and S. Rao, “Beyond the flow decomposition barrier,” Journal of the ACM, vol. 45, no. 5, pp. 783–797, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. J. Cheriyan, T. Hagerup, and K. Mehlhorn, “An o(n3)-time maximum-flow algorithm,” SIAM Journal on Computing, vol. 25, no. 6, pp. 1144–1170, 1996. View at Publisher · View at Google Scholar · View at MathSciNet
  25. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Elsevier Science B.V., Amsterdam, The Netherlands, 2004. View at MathSciNet
  26. S. M. S. Yazdi and S. A. Savari, “A max-flow/min-cut algorithm for linear deterministic relay networks,” IEEE Transactions on Information Theory, vol. 57, no. 5, pp. 3005–3015, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  27. G. P. Cachon, “Supply chain coordination with contracts,” Handbooks in Operations Research and Management Science C, vol. 11, pp. 227–339, 2003. View at Publisher · View at Google Scholar · View at Scopus
  28. Y. Fujii and T. Wadayama, “A coding theoretic approach for evaluating accumulate distribution on minimum cut capacity of weighted random graphs,” in Proceedings of the International Symposium on Information Theory and Its Applications, pp. 332–336, 2012.
  29. C. H. Glock and M. Y. Jaber, “Learning effects and the phenomenon of moving bottlenecks in a two-stage production system,” Applied Mathematical Modeling, vol. 37, no. 18, pp. 8617–8628, 2013. View at Publisher · View at Google Scholar