Lean buffering in serial production lines with Bernoulli machines

Hu, A. B.; Meerkov, S. M.

doi:https://doi.org/10.1155/MPE/2006/17105

Mathematical Problems in Engineering

On this page

Abstract References Copyright Related Articles

Open Access

Volume 2006 | Article ID 017105 | https://doi.org/10.1155/MPE/2006/17105

Lean buffering in serial production lines with Bernoulli machines

A. B. Hu¹and S. M. Meerkov¹

Received08 Feb 2006

Accepted07 Apr 2006

Published20 Jun 2006

Abstract

Lean buffering is the smallest buffer capacity necessary to ensure the desired production rate of a manufacturing system. In this paper, analytical methods for selecting lean buffering in serial production lines are developed under the assumption that the machines obey the Bernoulli reliability model. Both closed-form expressions and recursive approaches are investigated. The cases of identical and nonidentical machines are analyzed. Results obtained can be useful for production line designers and production managers to maintain the required production rate with the smallest possible inventories.

References

J. A. Buzacott, “Automatic transfer lines with buffer stocks,” International Journal of Production Research, vol. 5, pp. 183–200, 1967.
View at: Google Scholar
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
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
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 Site | Google Scholar | Zentralblatt MATH
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
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 Site | Google Scholar | Zentralblatt MATH | MathSciNet
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 Site | Google Scholar
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 Site | Google Scholar | Zentralblatt MATH
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
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
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 Site | Google Scholar

Copyright

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.

PDF Download Citation Order printed copies

Views

186

Downloads

880

Citations