##
**Lean buffering in serial production lines with Bernoulli machines.**
*(English)*
Zbl 1200.91158

Summary: 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.

PDF
BibTeX
XML
Cite

\textit{A. B. Hu} and \textit{S. M. Meerkov}, Math. Probl. Eng. 2006, No. 7, Article ID 17105, 24 p. (2006; Zbl 1200.91158)

Full Text:
DOI

### References:

[1] | J. A. Buzacott, “Automatic transfer lines with buffer stocks,” International Journal of Production Research, vol. 5, pp. 183-200, 1967. |

[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. |

[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. · Zbl 1124.90311 |

[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. · Zbl 1060.90551 |

[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. |

[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. · Zbl 0953.90018 |

[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. · Zbl 0919.90071 |

[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. · Zbl 0919.90072 |

[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. |

[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. |

[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. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.