Near optimal control of queueing networks over a finite time horizon

We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partition...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 170; no. 1; pp. 233 - 249
Main Authors: Nazarathy, Yoni, Weiss, Gideon
Format: Journal Article
Language:English
Published: Boston Springer US 01.09.2009
Springer Nature B.V
Subjects:
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a policy by which the queueing network tracks the fluid solution. To that end we model the deviations between the queuing and the fluid network in each of the intervals by a multi-class queueing network with some infinite virtual queues. We then keep these deviations stable by an adaptation of a maximum pressure policy. We show that this method is asymptotically optimal when the number of items that is processed and the processing speed increase. We illustrate these results through a simple example of a three stage re-entrant line.
AbstractList We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a policy by which the queueing network tracks the fluid solution. To that end we model the deviations between the queuing and the fluid network in each of the intervals by a multi-class queueing network with some infinite virtual queues. We then keep these deviations stable by an adaptation of a maximum pressure policy. We show that this method is asymptotically optimal when the number of items that is processed and the processing speed increase. We illustrate these results through a simple example of a three stage re-entrant line. [PUBLICATION ABSTRACT]
We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a policy by which the queueing network tracks the fluid solution. To that end we model the deviations between the queuing and the fluid network in each of the intervals by a multi-class queueing network with some infinite virtual queues. We then keep these deviations stable by an adaptation of a maximum pressure policy. We show that this method is asymptotically optimal when the number of items that is processed and the processing speed increase. We illustrate these results through a simple example of a three stage re-entrant line.
Author Nazarathy, Yoni
Weiss, Gideon
Author_xml – sequence: 1
  givenname: Yoni
  surname: Nazarathy
  fullname: Nazarathy, Yoni
  organization: Department of Statistics, The University of Haifa
– sequence: 2
  givenname: Gideon
  surname: Weiss
  fullname: Weiss, Gideon
  email: gweiss@stat.haifa.ac.il
  organization: Department of Statistics, The University of Haifa
BookMark eNp9kM1KAzEQgINUsK0-gLfgPZrZbLq7Ryn1B4pe9BzS7GxNXZOabLX6ND6LT2bKCoKgp2GY-ebnG5GB8w4JOQZ-CpwXZxF4XlSM85LxPBdsu0eGIIuMVUKUAzLkmcyZFIIfkFGMK845QCmHZHaDOlC_7uyTbqnxrgu-pb6hzxvcoHVL6rB79eExUv-CgerPj8Y62yFNBNIHH-y7d4dkv9FtxKPvOCb3F7O76RWb315eT8_nzAiQHatNLfPFoiiMbnQl-IQvBGIFJeoJZhJSRZjaSIFlLqBMuSxrgKbCZgINoBiTk37uOvh0YOzUym-CSytVBrnkUGZVaoK-yQQfY8BGrUP6Lrwp4GonS_WyVJKldrLUNjHFL8bYTnd250Pb9l8y68mYtrglhp-T_oa-ABrPgi0
CitedBy_id crossref_primary_10_1109_JSAC_2016_2611864
crossref_primary_10_1287_moor_2020_1110
crossref_primary_10_1080_00207541003720350
crossref_primary_10_1287_opre_2018_1749
crossref_primary_10_1007_s10107_018_1353_6
crossref_primary_10_1007_s11134_009_9121_1
crossref_primary_10_1109_TAC_2010_2046925
crossref_primary_10_1007_s11134_011_9258_6
crossref_primary_10_1016_j_sorms_2014_09_001
crossref_primary_10_1007_s00186_017_0583_3
crossref_primary_10_1007_s12543_010_0034_9
crossref_primary_10_1137_22M1529762
crossref_primary_10_1007_s10951_010_0174_0
crossref_primary_10_1137_110822992
crossref_primary_10_1007_s00245_011_9144_y
crossref_primary_10_1007_s10107_008_0217_x
crossref_primary_10_1287_opre_2020_2066
crossref_primary_10_1007_s11134_013_9362_x
crossref_primary_10_1287_opre_2021_2102
Cites_doi 10.1214/aoap/1075828046
10.1016/S0167-6377(02)00149-9
10.1137/S0363012999362724
10.1214/aoap/1060202837
10.1007/BF01158929
10.1073/pnas.39.9.947
10.1023/A:1019160803783
10.1239/jap/1127322036
10.1137/S036301290138376X
10.1214/aoap/1177004828
10.1287/opre.40.3.S312
10.1023/A:1019108819713
10.1109/9.341781
10.1287/opre.41.6.1104
10.1023/A:1019106213778
10.1214/aoap/1019487513
10.1007/s11134-006-0065-4
10.1137/0331073
10.1023/A:1019182903300
10.1214/aoap/1034801252
10.1109/70.282534
10.1007/s10107-008-0217-x
10.1080/00207728108963831
10.1214/aoap/1019737665
10.1287/opre.1040.0170
10.1023/A:1025130105303
10.1017/S0269964805050102
10.1109/ICC.2002.997009
10.1007/978-1-4613-0005-2
10.1007/978-1-4757-2418-9_11
ContentType Journal Article
Copyright Springer Science+Business Media, LLC 2008
Springer Science+Business Media, LLC 2009
Copyright_xml – notice: Springer Science+Business Media, LLC 2008
– notice: Springer Science+Business Media, LLC 2009
DBID AAYXX
CITATION
3V.
7TA
7TB
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
F~G
GNUQQ
HCIFZ
JG9
JQ2
K60
K6~
K7-
KR7
L.-
L6V
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10479-008-0443-x
DatabaseName CrossRef
ProQuest Central (Corporate)
Materials Business File
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One
ProQuest Central
Engineering Research Database
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
Materials Research Database
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
Civil Engineering Abstracts
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Materials Research Database
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
Materials Business File
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
ABI/INFORM Complete (Alumni Edition)
Civil Engineering Abstracts
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Materials Research Database

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1572-9338
EndPage 249
ExternalDocumentID 1680520371
10_1007_s10479_008_0443_x
Genre Feature
GroupedDBID -4X
-57
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
23M
28-
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
7WY
88I
8AO
8FE
8FG
8FL
8TC
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHQJS
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DWQXO
EBLON
EBO
EBS
EBU
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IAO
IEA
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N2Q
N95
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZD
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCF
SCLPG
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TH9
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7S
Z7U
Z7V
Z7W
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
Z8N
Z8U
Z92
ZL0
ZMTXR
ZYFGU
~8M
~A9
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
ICD
PHGZM
PHGZT
PQGLB
7TA
7TB
7XB
8AL
8FD
8FK
FR3
JG9
JQ2
KR7
L.-
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c315t-dcd54bb77cafa93060b3ee918ea6e251b773cdc53e843181b758d11f9ef61f1e3
IEDL.DBID RSV
ISICitedReferencesCount 23
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000265248100014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0254-5330
IngestDate Wed Nov 05 14:46:12 EST 2025
Sat Nov 29 02:40:22 EST 2025
Tue Nov 18 22:18:18 EST 2025
Fri Feb 21 02:36:54 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Continuous linear programming
Infinite virtual queues
Fluid approximations
Multi-class queueing networks
Queueing control
Maximum pressure policies
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c315t-dcd54bb77cafa93060b3ee918ea6e251b773cdc53e843181b758d11f9ef61f1e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 214501829
PQPubID 25585
PageCount 17
ParticipantIDs proquest_journals_214501829
crossref_primary_10_1007_s10479_008_0443_x
crossref_citationtrail_10_1007_s10479_008_0443_x
springer_journals_10_1007_s10479_008_0443_x
PublicationCentury 2000
PublicationDate 20090900
2009-9-00
20090901
PublicationDateYYYYMMDD 2009-09-01
PublicationDate_xml – month: 9
  year: 2009
  text: 20090900
PublicationDecade 2000
PublicationPlace Boston
PublicationPlace_xml – name: Boston
– name: New York
PublicationTitle Annals of operations research
PublicationTitleAbbrev Ann Oper Res
PublicationYear 2009
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Harrison, Suhov (CR21) 2002
Wein (CR36) 1992; 40
Anderson (CR3) 1981; 12
CR16
CR15
Harrison (CR20) 2001; 13
CR37
CR14
Harrison, Kelly, Zachary, Ziedins (CR18) 1996
CR32
Chen, Yao (CR8) 1993; 41
Dai (CR12) 1995; 5
Pullan (CR33) 1993; 31
Stolyar (CR34) 2004; 14
Adan, Weiss (CR2) 2006; 54
Maglaras (CR29) 2000; 10
Kushner (CR26) 2001
Harrison (CR19) 2000; 10
Connors, Feigin, Yao (CR11) 1994; 10
Dai, Lin (CR13) 2005; 53
Harrison, Fleming, Lions (CR17) 1988
Bellman (CR6) 1953; 39
Tassiulas (CR35) 1995; 40
Adan, Weiss (CR1) 2005; 19
Anderson, Nash (CR4) 1987
Maglaras (CR28) 1999; 31
Weiss (CR39) 2008; 115
Kopzon, Weiss (CR24) 2002; 30
Meyn (CR30) 2001; 40
Williams (CR40) 1998; 30
CR25
Kelly, Laws (CR23) 1993; 13
Meyn (CR31) 2003; 42
Avram, Bertsimas, Ricard, Kelly, Williams (CR5) 1995
Chen, Meyn (CR10) 1999; 32
Weiss (CR38) 2005; 42
Bramson (CR7) 1998; 30
Lawler, Lenstra, Rinnooy Kan, Shmoys, Graves, Rinnooy (CR27) 1993
Harrison, Van Mieghem (CR22) 1997; 7
Chen, Pandit, Meyn (CR9) 2003; 44
F. P. Kelly (443_CR23) 1993; 13
443_CR16
G. Weiss (443_CR39) 2008; 115
M. Bramson (443_CR7) 1998; 30
J. G. Dai (443_CR13) 2005; 53
J. M. Harrison (443_CR20) 2001; 13
I. J. B. F. Adan (443_CR2) 2006; 54
H. Chen (443_CR8) 1993; 41
M. C. Pullan (443_CR33) 1993; 31
L. Tassiulas (443_CR35) 1995; 40
C. Maglaras (443_CR29) 2000; 10
E. J. Anderson (443_CR4) 1987
J. G. Dai (443_CR12) 1995; 5
443_CR25
L. M. Wein (443_CR36) 1992; 40
J. M. Harrison (443_CR22) 1997; 7
R. R. Chen (443_CR10) 1999; 32
J. M. Harrison (443_CR21) 2002
J. M. Harrison (443_CR18) 1996
A. Kopzon (443_CR24) 2002; 30
D. Connors (443_CR11) 1994; 10
H. J. Kushner (443_CR26) 2001
E. J. Anderson (443_CR3) 1981; 12
A. L. Stolyar (443_CR34) 2004; 14
S. P. Meyn (443_CR30) 2001; 40
E. L. Lawler (443_CR27) 1993
S. P. Meyn (443_CR31) 2003; 42
G. Weiss (443_CR38) 2005; 42
R. J. Williams (443_CR40) 1998; 30
J. M. Harrison (443_CR17) 1988
R. Bellman (443_CR6) 1953; 39
C. Maglaras (443_CR28) 1999; 31
M. Chen (443_CR9) 2003; 44
443_CR32
443_CR14
J. M. Harrison (443_CR19) 2000; 10
I. J. B. F. Adan (443_CR1) 2005; 19
443_CR15
443_CR37
F. Avram (443_CR5) 1995
References_xml – volume: 14
  start-page: 1
  issue: 1
  year: 2004
  end-page: 53
  ident: CR34
  article-title: MaxWeight scheduling in a generalized switch: State space collapse and equivalent workload minimization under complete resource pooling
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1075828046
– volume: 30
  start-page: 351
  year: 2002
  end-page: 359
  ident: CR24
  article-title: A push pull queueing system
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(02)00149-9
– volume: 19
  start-page: 191
  year: 2005
  end-page: 212
  ident: CR1
  article-title: A two node Jackson network with infinite supply of work
  publication-title: Probability in Engineering and Informational Sciences
– volume: 40
  start-page: 741
  year: 2001
  end-page: 776
  ident: CR30
  article-title: Sequencing and routing in multiclass queueing networks. Part I: Feedback regulation
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/S0363012999362724
– ident: CR14
– year: 1993
  ident: CR27
  article-title: Sequencing and scheduling, algorithms and complexity
  publication-title: Logistics of production and inventory
– ident: CR16
– volume: 13
  start-page: 1119
  year: 2001
  end-page: 1150
  ident: CR20
  article-title: A broader view of Brownian networks
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1060202837
– volume: 13
  start-page: 47
  year: 1993
  end-page: 86
  ident: CR23
  article-title: Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1007/BF01158929
– ident: CR37
– volume: 39
  start-page: 947
  year: 1953
  end-page: 951
  ident: CR6
  article-title: Bottleneck problems and dynamic programming
  publication-title: Proceedings National Academy of Science
  doi: 10.1073/pnas.39.9.947
– volume: 30
  start-page: 89
  year: 1998
  end-page: 148
  ident: CR7
  article-title: State space collapse with application to heavy traffic limits for multiclass queueing networks
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019160803783
– volume: 42
  start-page: 879
  year: 2005
  end-page: 882
  ident: CR38
  article-title: Jackson networks with unlimited supply of work
  publication-title: Journal of Applied Probability
  doi: 10.1239/jap/1127322036
– volume: 42
  start-page: 178
  year: 2003
  end-page: 217
  ident: CR31
  article-title: Sequencing and routing in multiclass queueing networks. Part II: Workload relaxations
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/S036301290138376X
– volume: 5
  start-page: 49
  year: 1995
  end-page: 77
  ident: CR12
  article-title: On positive Harris recurrence of multi-class queueing networks: a unified approach via fluid limit models
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1177004828
– volume: 40
  start-page: S312
  year: 1992
  end-page: S334
  ident: CR36
  article-title: Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs
  publication-title: Operations Research
  doi: 10.1287/opre.40.3.S312
– ident: CR25
– volume: 30
  start-page: 27
  year: 1998
  end-page: 88
  ident: CR40
  article-title: Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019108819713
– year: 1987
  ident: CR4
  publication-title: Linear programming in infinite dimensional spaces
– volume: 40
  start-page: 236
  year: 1995
  ident: CR35
  article-title: Adaptive back-pressure congestion control based on local information
  publication-title: IEEE Transactions on Automatic Control
  doi: 10.1109/9.341781
– volume: 41
  start-page: 1104
  year: 1993
  end-page: 1115
  ident: CR8
  article-title: Dynamic scheduling of a multi class fluid network
  publication-title: Operations Research
  doi: 10.1287/opre.41.6.1104
– volume: 31
  start-page: 171
  year: 1999
  end-page: 206
  ident: CR28
  article-title: Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019106213778
– start-page: 199
  year: 1995
  end-page: 234
  ident: CR5
  article-title: Fluid models of sequencing problems in open queueing networks: an optimal control approach
  publication-title: Stochastic networks
– volume: 10
  start-page: 897
  year: 2000
  end-page: 929
  ident: CR29
  article-title: Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1019487513
– volume: 54
  start-page: 169
  year: 2006
  end-page: 183
  ident: CR2
  article-title: Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1007/s11134-006-0065-4
– ident: CR15
– start-page: 147
  year: 1996
  end-page: 186
  ident: CR18
  article-title: The BIGSTEP approach to flow management in stochastic processing networks
  publication-title: Stochastic networks: theory and applications
– volume: 31
  start-page: 1558
  year: 1993
  end-page: 1577
  ident: CR33
  article-title: An algorithm for a class of continuous linear programs
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/0331073
– volume: 32
  start-page: 65
  year: 1999
  end-page: 97
  ident: CR10
  article-title: Value iteration and optimization of multiclass queueing networks
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019182903300
– volume: 7
  start-page: 747
  year: 1997
  end-page: 771
  ident: CR22
  article-title: Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1034801252
– ident: CR32
– volume: 10
  start-page: 88
  year: 1994
  end-page: 98
  ident: CR11
  article-title: Scheduling semiconductor lines using a fluid network model
  publication-title: IEEE Transactions on Robotics and Automation
  doi: 10.1109/70.282534
– volume: 115
  start-page: 151
  year: 2008
  end-page: 198
  ident: CR39
  article-title: A simplex based algorithm to solve separated continuous linear programs
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-008-0217-x
– volume: 12
  start-page: 1469
  year: 1981
  end-page: 1475
  ident: CR3
  article-title: A new continuous model for job-shop scheduling
  publication-title: International Journal Systems Science
  doi: 10.1080/00207728108963831
– year: 1988
  ident: CR17
  article-title: Brownian models of queueing networks with heterogeneous customer populations
  publication-title: Proceedings of the IMA workshop on stochastic differential systems
– volume: 10
  start-page: 75
  year: 2000
  end-page: 103
  ident: CR19
  article-title: Brownian models of open processing networks: canonical representation of workload
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1019737665
– volume: 53
  start-page: 197
  year: 2005
  end-page: 218
  ident: CR13
  article-title: Maximum pressure policies in stochastic processing networks
  publication-title: Operations Research
  doi: 10.1287/opre.1040.0170
– year: 2002
  ident: CR21
  article-title: Stochastic networks and activity analysis
  publication-title: Analytic methods in applied probability, In memory of Fridrik Karpelevich
– year: 2001
  ident: CR26
  publication-title: Heavy traffic analysis of controlled queueing and communication networks
– volume: 44
  start-page: 313
  year: 2003
  end-page: 363
  ident: CR9
  article-title: In search of sensitivity in network optimization
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1025130105303
– volume: 19
  start-page: 191
  year: 2005
  ident: 443_CR1
  publication-title: Probability in Engineering and Informational Sciences
  doi: 10.1017/S0269964805050102
– volume: 44
  start-page: 313
  year: 2003
  ident: 443_CR9
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1025130105303
– volume: 53
  start-page: 197
  year: 2005
  ident: 443_CR13
  publication-title: Operations Research
  doi: 10.1287/opre.1040.0170
– volume: 12
  start-page: 1469
  year: 1981
  ident: 443_CR3
  publication-title: International Journal Systems Science
  doi: 10.1080/00207728108963831
– volume: 5
  start-page: 49
  year: 1995
  ident: 443_CR12
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1177004828
– volume: 31
  start-page: 1558
  year: 1993
  ident: 443_CR33
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/0331073
– ident: 443_CR25
– volume: 31
  start-page: 171
  year: 1999
  ident: 443_CR28
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019106213778
– volume: 30
  start-page: 27
  year: 1998
  ident: 443_CR40
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019108819713
– volume: 32
  start-page: 65
  year: 1999
  ident: 443_CR10
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019182903300
– ident: 443_CR32
  doi: 10.1109/ICC.2002.997009
– volume: 40
  start-page: 236
  year: 1995
  ident: 443_CR35
  publication-title: IEEE Transactions on Automatic Control
  doi: 10.1109/9.341781
– volume-title: Proceedings of the IMA workshop on stochastic differential systems
  year: 1988
  ident: 443_CR17
– ident: 443_CR14
– volume: 40
  start-page: S312
  year: 1992
  ident: 443_CR36
  publication-title: Operations Research
  doi: 10.1287/opre.40.3.S312
– ident: 443_CR16
– volume-title: Analytic methods in applied probability, In memory of Fridrik Karpelevich
  year: 2002
  ident: 443_CR21
– volume: 40
  start-page: 741
  year: 2001
  ident: 443_CR30
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/S0363012999362724
– ident: 443_CR37
– volume: 14
  start-page: 1
  issue: 1
  year: 2004
  ident: 443_CR34
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1075828046
– volume: 30
  start-page: 351
  year: 2002
  ident: 443_CR24
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(02)00149-9
– volume: 10
  start-page: 897
  year: 2000
  ident: 443_CR29
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1019487513
– volume: 41
  start-page: 1104
  year: 1993
  ident: 443_CR8
  publication-title: Operations Research
  doi: 10.1287/opre.41.6.1104
– volume: 10
  start-page: 75
  year: 2000
  ident: 443_CR19
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1019737665
– volume: 10
  start-page: 88
  year: 1994
  ident: 443_CR11
  publication-title: IEEE Transactions on Robotics and Automation
  doi: 10.1109/70.282534
– volume: 13
  start-page: 47
  year: 1993
  ident: 443_CR23
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1007/BF01158929
– volume: 54
  start-page: 169
  year: 2006
  ident: 443_CR2
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1007/s11134-006-0065-4
– volume-title: Logistics of production and inventory
  year: 1993
  ident: 443_CR27
– volume: 42
  start-page: 178
  year: 2003
  ident: 443_CR31
  publication-title: SIAM Journal Control and Optimization
  doi: 10.1137/S036301290138376X
– volume-title: Heavy traffic analysis of controlled queueing and communication networks
  year: 2001
  ident: 443_CR26
  doi: 10.1007/978-1-4613-0005-2
– start-page: 147
  volume-title: Stochastic networks: theory and applications
  year: 1996
  ident: 443_CR18
– volume: 7
  start-page: 747
  year: 1997
  ident: 443_CR22
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1034801252
– volume: 115
  start-page: 151
  year: 2008
  ident: 443_CR39
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-008-0217-x
– volume: 42
  start-page: 879
  year: 2005
  ident: 443_CR38
  publication-title: Journal of Applied Probability
  doi: 10.1239/jap/1127322036
– volume: 13
  start-page: 1119
  year: 2001
  ident: 443_CR20
  publication-title: Annals of Applied Probability
  doi: 10.1214/aoap/1060202837
– volume: 30
  start-page: 89
  year: 1998
  ident: 443_CR7
  publication-title: Queueing Systems Theory and Applications
  doi: 10.1023/A:1019160803783
– start-page: 199
  volume-title: Stochastic networks
  year: 1995
  ident: 443_CR5
  doi: 10.1007/978-1-4757-2418-9_11
– ident: 443_CR15
– volume-title: Linear programming in infinite dimensional spaces
  year: 1987
  ident: 443_CR4
– volume: 39
  start-page: 947
  year: 1953
  ident: 443_CR6
  publication-title: Proceedings National Academy of Science
  doi: 10.1073/pnas.39.9.947
SSID ssj0001185
Score 2.0092041
Snippet We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 233
SubjectTerms Approximation
Business and Management
Combinatorics
Job shops
Linear programming
Mathematical models
Operations research
Operations Research/Decision Theory
Optimization
Queuing
Servers
Statistical analysis
Studies
Theory of Computation
Wireless networks
SummonAdditionalLinks – databaseName: ABI/INFORM Collection
  dbid: 7WY
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60iujBalWsVdmDJyWY92ZPIj7wIMWDj3oKyT6woEltWin-emeTTauCvXgLZLMMmd3ZbzJf5gM4QtDhplQxy3UEJihuIKxUd8KMlIpESKmwS4Ls4y3tdqNej90Zbk5haJV1TCwDtci5_kZ-qjtq2wiG2dng3dKiUbq4ahQ0FmEJz-lACxjQp-dpIEbsXDIYMQeyNImyLmpWf875lFll7d9H0yY_j6UZ1vxVHi1PnevmP-3dgHUDN8l5tT42YUFmLVip2e4taNaqDsRs8hasfWtRuAWXXdwKJMfA8obzGGI7yRVBW8YSh5CsIpIXRJNBSUJUX8NYokXryQua9Jln2_BwfXV_cWMZ5QWLe04wsgQXgZ-mlPJEJQyzCjv1pGROJJNQIiLCOx4XPPBkhAAEkS9mHcJxFJMqdJQjvR1oZHkmd4G4XPHExsGpx_zEVSxgtuR4YYswTEPeBrt-8TE3bcm1OsZrPGuorH0Vl3KZ6Kt40obj6SODqifHvMGd2j-x2Z5FPHVOG05qB8_u_jnX3ty5OrBalZo0AW0fGqPhWB7AMv8Y9YvhYbk0vwAWiOos
  priority: 102
  providerName: ProQuest
Title Near optimal control of queueing networks over a finite time horizon
URI https://link.springer.com/article/10.1007/s10479-008-0443-x
https://www.proquest.com/docview/214501829
Volume 170
WOSCitedRecordID wos000265248100014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: 7WY
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: M0C
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: P5Z
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: K7-
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: M7S
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: BENPR
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: M2P
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1572-9338
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001185
  issn: 0254-5330
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB7UiujBR1Ws1bIHT0ogjyabPWqpCGoJ1kf1EpJ9YEETaaqIv8bf4i9zNk1aFRX0MiTsZFj2lW-Yb2cAdhB02DFVzLAtgQ6K7Qoj1pkwfaV84VEqzJwge3lCOx2_12NBcY87K9nuZUgyP6k_XHZrUmbk4fomWkPgWHF1shntoncvx8cvIuact4iej6Gpk2Uo8zsTn39GE4T5JSia_2sOl_7Vy2VYLKAl2R-thRWYkkkV5kpmexWWygoOpNjQVVj4kI5wFdodXPYkxUPkHu0UJHaSKoL9fZSoQpIRaTwjmvhJordX1deYlegK9eQ2HfRf0mQNLg7b560joyizYHDHcoeG4MJtxjGlPFIRQxfCjB0pmeXLyJMIf7DF4YK7jvQRbSDMRRdDWJZiUnmWsqSzDjNJmsgNIDZXPDJROXZYM7IVc5kpOT6YwvNij9fALMc75EUOcl0K4y6cZE_W4xfmtTFx_MLnGuyOP3kYJeD4TbleTmJY7MUs1LnYTXSjWA32yjmbtP5oa_NP2nWYH8WZNPtsC2aGg0e5DbP8adjPBg2YplfXDagctDvBGb4dUwPlqdnS0g60pF2UgXvTyFfzO6BN6Wc
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V25TsQwEB1xiaPgWEAspwtoQBa5ExcIIQ6BdllRAKILiQ-BBAmwy_lP_CPjJN4FJOgo6CLZHiX2eOY58zwDsIqgw0lDxahjCzygOL6gqc6EGSkViSAMhVUQZM-bYasVXVywkz54N3dhNK3S2MTCUIuc63_kmzqjtoVgmG3f3VNdNEoHV00FjVIrGvL1GU9s7a2jPVzeNcc52D_dPaRVUQHKXdvvUMGF76VpGPJEJQwBs5W6UjI7kkkg0dlji8sF910ZoW9FUIeAWti2YlIFtrKli3L7YdBzo0BvqEZIu4YfsXrBmMQzF9WkTRNELW_qeSGjBdfAw6l4-eoGe9j2Wzi28HIHE_9sfiZhvILTZKfU_ynok1kNhg2bvwYTpmoFqYxYDcY-pWCchr0WvjTJ0XDeopyKuE9yRfDbHyV2IVlJlG8TTXYlCVHXGqYTHCDJFU7BW57NwNmffOQsDGR5JueAOFzxxMLOqcu8xFHMZ5bk-GCJIEgDXgfLLHTMq7TruvrHTdxLGK11Iy7KgaJuxC91WO8OuStzjvzWecHoQ1yZn3bcVYY6bBiF6rX-KGv-V1krMHJ4etyMm0etxgKMlmE1TbZbhIHOw6NcgiH-1LluPywX24LA5V_r2QfG4kgj
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LLwRBEK6wRDh4LGI9-8CFTMxj59EHEawNIZONIG5jph8hYQa7y_LP_DvVM9O7SLg5uE3S3ZWZ7uqqr6a_rgJYR9BhJ76khm1xDFBslxuJyoQZSBlwz_e5mRNkL0_9MAyurmhrCN71XRhFq9Q2MTfUPGPqH_m2yqhtIhim27JkRbQazd2HR0MVkFIHrbqaRqEhJ-L1BaO39s5xA5d6w7abh-cHR0ZZYMBgjuV2DM64W08S32exjCmCZzNxhKBWIGJPoOPHFodx5joiQD-LAA_BNbcsSYX0LGkJB-UOw4jvYMxTgZH9w7B11ncDiNxz_iRGYIaicOoj1eLeXt2nRs48qOPE9L46xQHS_XY4m_u85tQ_nq1pmCyBNtkrdsYMDIm0CmOa51-FKV3PgpTmrQoTn5IzzkIjxJcmGZrUe5RTUvpJJgnOQ1dgF5IWFPo2UTRYEhN5qwA8wQGC3OAUvGXpHFz8yUfOQyXNUrEAxGaSxSZ2Thxaj21JXWoKhg8m97zEYzUw9aJHrEzIruqC3EWDVNJKT6K8UCjqSdSrwWZ_yEORjeS3zktaN6LSMLWjvmLUYEsr16D1R1mLv8pagzFUr-j0ODxZgvHivE2x8Jah0nnqihUYZc-d2_bTarlHCFz_taJ9ANwEUnU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Near+optimal+control+of+queueing+networks+over+a%C2%A0finite+time+horizon&rft.jtitle=Annals+of+operations+research&rft.au=Nazarathy%2C+Yoni&rft.au=Weiss%2C+Gideon&rft.date=2009-09-01&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=170&rft.issue=1&rft.spage=233&rft.epage=249&rft_id=info:doi/10.1007%2Fs10479-008-0443-x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10479_008_0443_x
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon