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

Gideon Weiss

doi:10.1023/a:1018907403413

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

Gideon Weiss

Department of Statistics

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1023/a:1018907403413
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

Access to Document

10.1023/a:1018907403413

Cite this

@article{5946d3dc502047c091e11a60dc6e99cc,

title = "An algorithm for minimum wait draining of two-station fluid re-entrant line",

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

keywords = "Continuous linear programming, Control of multiclass queueing networks, Fluid approximation, Re-entrant line, Scheduling",

author = "Gideon Weiss",

year = "1999",

doi = "10.1023/a:1018907403413",

language = "English",

volume = "92",

pages = "65--86",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

}

TY - JOUR

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

AU - Weiss, Gideon

PY - 1999

Y1 - 1999

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

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

KW - Continuous linear programming

KW - Control of multiclass queueing networks

KW - Fluid approximation

KW - Re-entrant line

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0033482122&partnerID=8YFLogxK

U2 - 10.1023/a:1018907403413

DO - 10.1023/a:1018907403413

M3 - Article

AN - SCOPUS:0033482122

SN - 0254-5330

VL - 92

SP - 65

EP - 86

JO - Annals of Operations Research

JF - Annals of Operations Research

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this