Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2006, Article ID 17105, 24 pages
http://dx.doi.org/10.1155/MPE/2006/17105

Lean buffering in serial production lines with Bernoulli machines

Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109-2122, USA

Received 8 February 2006; Accepted 7 April 2006

Copyright © 2006 A. B. Hu and S. M. Meerkov. 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. J. A. Buzacott, “Automatic transfer lines with buffer stocks,” International Journal of Production Research, vol. 5, pp. 183–200, 1967. View at Google Scholar
  2. E. Enginarlar, J. Li, and S. M. Meerkov, “How lean can lean buffers be?” IIE Transactions, vol. 37, no. 4, pp. 333–342, 2005. View at Google Scholar
  3. E. Enginarlar, J. Li, and S. M. Meerkov, “Lean buffering in serial production lines with non-exponential machines,” in Stochastic Modeling of Manufacturing Systems, G. Liberopoulos, C. T. Papadopoulos, B. Tan, J. MacGregor Smith, and S. B. Gershwin, Eds., pp. 29–53, Springer, New York, 2006. View at Google Scholar
  4. E. Enginarlar, J. Li, S. M. Meerkov, and R. Q. Zhang, “Buffer capacity for accommodating machine downtime in serial production lines,” International Journal of Production Research, vol. 40, no. 3, pp. 601–624, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. S. B. Gershwin and Y. Goldis, “Efficient algorithms for transfer line design,” Report LMP-95-005, Laboratory of Manufacturing and Productivity, MIT, Massachusetts, 1995. View at Google Scholar
  6. S. B. Gershwin and J. E. Schor, “Efficient algorithms for buffer space allocation,” Annals of Operations Research, vol. 93, no. 1–4, pp. 117–144, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. D. Jacobs and S. M. Meerkov, “Mathematical theory of improvability for production systems,” Mathematical Problems in Engineering, vol. 1, no. 2, pp. 95–137, 1995. View at Publisher · View at Google Scholar
  8. 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 Zentralblatt MATH
  9. J. MacGregor Smith and F. R. B. Cruz, “The buffer allocation problem for general finite buffer queueing networks,” IIE Transactions, vol. 37, no. 4, pp. 343–365, 2005. View at Google Scholar
  10. J. O. McClain, R. Conway, W. Maxwell, and L. J. Thomas, “The role of work-in-process inventory in serial production lines,” Operations Research, vol. 36, no. 2, pp. 229–241, 1988. View at Google Scholar
  11. H. Yamashita and T. Altiok, “Buffer capacity allocation for a desired throughput in production lines,” IIE Transactions, vol. 30, no. 10, pp. 883–892, 1998. View at Publisher · View at Google Scholar