Minimum Flow Time in a Tandem Two-Server Fluid Network

Yossef Luzon; Eugene Khmelnitsky; Yariv Marmor

doi:10.1109/TAC.2016.2614271

Minimum Flow Time in a Tandem Two-Server Fluid Network

Yossef Luzon, Eugene Khmelnitsky, Yariv Marmor

Department of Industrial Engineering

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

Abstract

We consider a tandem two-server fluid network with two fluid types. Each server in the network has two buffers, one for each fluid, and the capacity of each server can be shared among the fluids. An initial amount of fluids is to be processed by both servers and drained through the system. We determine the processing rates for which the servers' capacity is optimally shared, with the objective of minimizing the total flow time. Three cases of the optimal strategy are discussed.

Original language	English
Pages (from-to)	3540-3545
Number of pages	6
Journal	IEEE Transactions on Automatic Control
Volume	62
Issue number	7
DOIs	https://doi.org/10.1109/TAC.2016.2614271
State	Published - Jul 2017

Keywords

Cμ-Rule
multiclass fluid network
optimal control
the maximum principle
threshold policy

Access to Document

10.1109/TAC.2016.2614271

Cite this

@article{b144f76e77324bed81ca3cba63d24cf2,

title = "Minimum Flow Time in a Tandem Two-Server Fluid Network",

abstract = "We consider a tandem two-server fluid network with two fluid types. Each server in the network has two buffers, one for each fluid, and the capacity of each server can be shared among the fluids. An initial amount of fluids is to be processed by both servers and drained through the system. We determine the processing rates for which the servers' capacity is optimally shared, with the objective of minimizing the total flow time. Three cases of the optimal strategy are discussed.",

keywords = "Cμ-Rule, multiclass fluid network, optimal control, the maximum principle, threshold policy",

author = "Yossef Luzon and Eugene Khmelnitsky and Yariv Marmor",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.",

year = "2017",

month = jul,

doi = "10.1109/TAC.2016.2614271",

language = "אנגלית",

volume = "62",

pages = "3540--3545",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Minimum Flow Time in a Tandem Two-Server Fluid Network

AU - Luzon, Yossef

AU - Khmelnitsky, Eugene

AU - Marmor, Yariv

PY - 2017/7

Y1 - 2017/7

N2 - We consider a tandem two-server fluid network with two fluid types. Each server in the network has two buffers, one for each fluid, and the capacity of each server can be shared among the fluids. An initial amount of fluids is to be processed by both servers and drained through the system. We determine the processing rates for which the servers' capacity is optimally shared, with the objective of minimizing the total flow time. Three cases of the optimal strategy are discussed.

AB - We consider a tandem two-server fluid network with two fluid types. Each server in the network has two buffers, one for each fluid, and the capacity of each server can be shared among the fluids. An initial amount of fluids is to be processed by both servers and drained through the system. We determine the processing rates for which the servers' capacity is optimally shared, with the objective of minimizing the total flow time. Three cases of the optimal strategy are discussed.

KW - Cμ-Rule

KW - multiclass fluid network

KW - optimal control

KW - the maximum principle

KW - threshold policy

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

U2 - 10.1109/TAC.2016.2614271

DO - 10.1109/TAC.2016.2614271

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85027556700

SN - 0018-9286

VL - 62

SP - 3540

EP - 3545

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 7

ER -

Minimum Flow Time in a Tandem Two-Server Fluid Network

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this