• Home
  • Search
  • Efficient algorithms for buffer space allocation
  • Cite Icon240
  • https://doi.org/10.1023/a:1018988226612Copy DOI Icon

Efficient algorithms for buffer space allocation

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.