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.
- Continuous linear programming
- Control of multiclass queueing networks
- Fluid approximation
- Re-entrant line
ASJC Scopus subject areas
- Decision Sciences (all)
- Management Science and Operations Research