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.
| Original language | English |
|---|---|
| Pages (from-to) | 65-86 |
| Number of pages | 22 |
| Journal | Annals of Operations Research |
| Volume | 92 |
| DOIs | |
| State | Published - 1999 |
Keywords
- Continuous linear programming
- Control of multiclass queueing networks
- Fluid approximation
- Re-entrant line
- Scheduling
ASJC Scopus subject areas
- General Decision Sciences
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'An algorithm for minimum wait draining of two-station fluid re-entrant line'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver