zbMATH — the first resource for mathematics

Efficient algorithms for buffer space allocation. (English) Zbl 0953.90018
Summary: This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the primal problem is solved using the dual solution. Numerical results are presented. Profit optimization problems are natural generalizations of the primal and dual problems, and we show how they can be solved using essentially the same algorithms.

90B30 Production models
90B80 Discrete location and assignment
Full Text: DOI