TY - JOUR
T1 - Assigning multiple job types to parallel specialized servers
AU - van der Laan, Dinard
PY - 2018/12
Y1 - 2018/12
N2 - In this paper methods of mixing decision rules are investigated and applied to the so-called multiple job type assignment problem with specialized servers. This problem is modeled as continuous time Markov decision process. For this assignment problem performance optimization is in general considered to be difficult. Moreover, for optimal dynamic Markov decision policies the corresponding decision rules have in general a complicated structure not facilitating a smooth implementation. On the other hand optimization over the subclass of so-called static policies is known to be tractable. In the current paper a suitable static decision rule is mixed with dynamic decision rules which are selected such that these rules are relatively easy to describe and implement. Some mixing methods are discussed and optimization is performed over corresponding classes of so-called mixing policies. These mixing policies maintain the property that they are easy to describe and implement compared to overall optimal dynamic Markov decision policies. Besides for all investigated instances the optimized mixing policies perform substantially better than optimal static policies.
AB - In this paper methods of mixing decision rules are investigated and applied to the so-called multiple job type assignment problem with specialized servers. This problem is modeled as continuous time Markov decision process. For this assignment problem performance optimization is in general considered to be difficult. Moreover, for optimal dynamic Markov decision policies the corresponding decision rules have in general a complicated structure not facilitating a smooth implementation. On the other hand optimization over the subclass of so-called static policies is known to be tractable. In the current paper a suitable static decision rule is mixed with dynamic decision rules which are selected such that these rules are relatively easy to describe and implement. Some mixing methods are discussed and optimization is performed over corresponding classes of so-called mixing policies. These mixing policies maintain the property that they are easy to describe and implement compared to overall optimal dynamic Markov decision policies. Besides for all investigated instances the optimized mixing policies perform substantially better than optimal static policies.
KW - Assignment
KW - Implementation
KW - Markov decision process
KW - Mixing decision rules
KW - Specialized servers
UR - http://www.scopus.com/inward/record.url?scp=85047139323&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047139323&partnerID=8YFLogxK
U2 - 10.1007/s10626-018-0271-3
DO - 10.1007/s10626-018-0271-3
M3 - Article
AN - SCOPUS:85047139323
SN - 0924-6703
VL - 28
SP - 471
EP - 507
JO - Discrete Event Dynamic Systems
JF - Discrete Event Dynamic Systems
IS - 4
ER -