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

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 92; p. 65
Main Author:	Weiss, Gideon
Format:	Journal Article
Language:	English
Published:	New York Springer Nature B.V 01.01.1999
Subjects:	Algorithms Approximation Linear programming Mathematical programming Operations research Performance evaluation Scheduling Studies
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!