Efficient algorithms for buffer space allocation

Stanley Gershwin () and James Schor ()

Annals of Operations Research, 2000, vol. 93, issue 1, 117-144

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. Copyright Kluwer Academic Publishers 2000

Date: 2000
References: Add references at CitEc
Citations: View citations in EconPapers (27)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018988226612 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:93:y:2000:i:1:p:117-144:10.1023/a:1018988226612

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018988226612

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().