An algorithm for minimum wait draining of two-station fluid re-entrant line

In a fluid re-entrant line, fluid moves through a sequence of K buffers, partitioned by their service to I stations. We consider the initial fluid in the system, with no external input. Our objective is to empty all the fluid in the line with minimum total inventory. We present a polynomial time alg...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 92; s. 65
Hlavní autor: Weiss, Gideon
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.01.1999
Témata:
Algorithms
Approximation
Linear programming
Mathematical programming
Operations research
Performance evaluation
Scheduling
Studies
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In a fluid re-entrant line, fluid moves through a sequence of K buffers, partitioned by their service to I stations. We consider the initial fluid in the system, with no external input. Our objective is to empty all the fluid in the line with minimum total inventory. We present a polynomial time algorithm for this problem, for the case I = 2. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1023/A:1018907403413