Research output: Contribution to journal › Article
Designs of optimal switching feedback decentralized control policies for fluid queueing networks. / Feoktistova, V.N.; Matveev, A.S.; Lefeber, E.; Rooda, J.E.
In: Mathematics of Control, Signals, and Systems, Vol. 24, No. 4, 2012, p. 477--503.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Designs of optimal switching feedback decentralized control policies for fluid queueing networks
AU - Feoktistova, V.N.
AU - Matveev, A.S.
AU - Lefeber, E.
AU - Rooda, J.E.
PY - 2012
Y1 - 2012
N2 - The paper considers standard fluid models of multi-product multipleserver production systems where setup times are incurred whenever a server changes product. We consider a general approach to the problem of optimizing the long-run average cost per unit time that consists of first determining an optimal steady state (periodic) behavior and then to design a feedback scheduling protocol ensuring convergence to this behavior as time progresses. In this paper, we focus on the latter part and introduce a systematic approach. This approach gives rise to protocols that are cyclic and distributed: the servers do not need information about the entire system state. Each of them proceeds basically from the local data concerning only the currently served queue, although a fixed finite number of one-bit notification signals should be exchanged between the servers during every cycle. The approach is illustrated by simple instructive examples concerning polling systems, single server systems with processor sharing scheme, a
AB - The paper considers standard fluid models of multi-product multipleserver production systems where setup times are incurred whenever a server changes product. We consider a general approach to the problem of optimizing the long-run average cost per unit time that consists of first determining an optimal steady state (periodic) behavior and then to design a feedback scheduling protocol ensuring convergence to this behavior as time progresses. In this paper, we focus on the latter part and introduce a systematic approach. This approach gives rise to protocols that are cyclic and distributed: the servers do not need information about the entire system state. Each of them proceeds basically from the local data concerning only the currently served queue, although a fixed finite number of one-bit notification signals should be exchanged between the servers during every cycle. The approach is illustrated by simple instructive examples concerning polling systems, single server systems with processor sharing scheme, a
KW - Hybrid dynamical systems · Optimal switched control · Control of networks · Fluid models · Queueing
U2 - DOI 10.1007/s00498-012-0086-y
DO - DOI 10.1007/s00498-012-0086-y
M3 - Article
VL - 24
SP - 477
EP - 503
JO - Mathematics of Control, Signals, and Systems
JF - Mathematics of Control, Signals, and Systems
SN - 0932-4194
IS - 4
ER -
ID: 5362001