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

Podrobná bibliografia

Vydané v:	Annals of operations research Ročník 92; s. 65
Hlavný autor:	Weiss, Gideon
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer Nature B.V 01.01.1999
Predmet:	Algorithms Approximation Linear programming Mathematical programming Operations research Performance evaluation Scheduling Studies
ISSN:	0254-5330, 1572-9338
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!