An algorithm for minimum wait drainingof two‐station fluid re‐entrant line

G. Weiss

Annals of Operations Research, 1999, vol. 92, issue 0, 65-86

Abstract: In a fluid re‐entrant line, fluid moves through a sequence of K buffers, partitioned by their service to I stations. We consider theinitial fluid in the system, with no external input.Our objective is to empty all the fluid in the line with minimum total inventory. We presenta polynomial time algorithm for this problem, for the case I=2. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018907403413 (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:92:y:1999:i:0:p:65-86:10.1023/a:1018907403413

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

DOI: 10.1023/A:1018907403413

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 ().