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

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

0.00 Avg rating—0 Votes
Article ID: iaor20013876
Country: Netherlands
Volume: 92
Start Page Number: 65
End Page Number: 86
Publication Date: Nov 1999
Journal: Annals of Operations Research
Authors:
Keywords: programming: linear
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.