Dynamic server assignment in an extended machine-repair model

J.L. Dorsman, S. Bhulai, M. Vlasiou

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
2 Downloads (Pure)

Abstract

This article considers an extension of the classic machine-repair problem. The machines, apart from receiving service from a single repairman, now also supply service themselves to queues of products. The extended model can be viewed as a two-layered queueing network, in which the queues of products in the first layer are generally correlated, due to the fact that the machines have to share the repairman’s capacity in the second layer. Of particular interest is the dynamic control problem of how the repairman should allocate his/her capacity to the machines at any point in time so that the long-term average (weighted) sum of the queue lengths of the first-layer queues is minimized. Since the optimal policy for the repairman cannot be found analytically due to the correlations in the queue lengths, a near-optimal policy is proposed. This is obtained by combining intuition and results from queueing theory with techniques from Markov decision theory. Specifically, the relative value functions for several policies for which the model can be decomposed in less complicated subsystems are studied, and the results are combined with the classic one-step policy improvement algorithm. The resulting policy is easy to apply, is scalable in the number of machines, and is shown to be highly accurate over a wide range of parameter settings. Keywords: Layered queueing networks, Markov decision processes, one-step policy improvement, near-optimal policies
Original languageEnglish
Pages (from-to)392-413
JournalIIE Transactions
Volume47
Issue number4
DOIs
Publication statusPublished - 2015

Fingerprint

Queueing networks
Repair
Servers
Queueing theory
Decision theory

Cite this

Dorsman, J.L. ; Bhulai, S. ; Vlasiou, M. / Dynamic server assignment in an extended machine-repair model. In: IIE Transactions. 2015 ; Vol. 47, No. 4. pp. 392-413.
@article{6a3f1eb836de4def939aed008d98e419,
title = "Dynamic server assignment in an extended machine-repair model",
abstract = "This article considers an extension of the classic machine-repair problem. The machines, apart from receiving service from a single repairman, now also supply service themselves to queues of products. The extended model can be viewed as a two-layered queueing network, in which the queues of products in the first layer are generally correlated, due to the fact that the machines have to share the repairman’s capacity in the second layer. Of particular interest is the dynamic control problem of how the repairman should allocate his/her capacity to the machines at any point in time so that the long-term average (weighted) sum of the queue lengths of the first-layer queues is minimized. Since the optimal policy for the repairman cannot be found analytically due to the correlations in the queue lengths, a near-optimal policy is proposed. This is obtained by combining intuition and results from queueing theory with techniques from Markov decision theory. Specifically, the relative value functions for several policies for which the model can be decomposed in less complicated subsystems are studied, and the results are combined with the classic one-step policy improvement algorithm. The resulting policy is easy to apply, is scalable in the number of machines, and is shown to be highly accurate over a wide range of parameter settings. Keywords: Layered queueing networks, Markov decision processes, one-step policy improvement, near-optimal policies",
author = "J.L. Dorsman and S. Bhulai and M. Vlasiou",
year = "2015",
doi = "10.1080/0740817X.2014.928962",
language = "English",
volume = "47",
pages = "392--413",
journal = "IIE Transactions",
issn = "0740-817X",
publisher = "Taylor and Francis Ltd.",
number = "4",

}

Dynamic server assignment in an extended machine-repair model. / Dorsman, J.L.; Bhulai, S.; Vlasiou, M.

In: IIE Transactions, Vol. 47, No. 4, 2015, p. 392-413.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Dynamic server assignment in an extended machine-repair model

AU - Dorsman, J.L.

AU - Bhulai, S.

AU - Vlasiou, M.

PY - 2015

Y1 - 2015

N2 - This article considers an extension of the classic machine-repair problem. The machines, apart from receiving service from a single repairman, now also supply service themselves to queues of products. The extended model can be viewed as a two-layered queueing network, in which the queues of products in the first layer are generally correlated, due to the fact that the machines have to share the repairman’s capacity in the second layer. Of particular interest is the dynamic control problem of how the repairman should allocate his/her capacity to the machines at any point in time so that the long-term average (weighted) sum of the queue lengths of the first-layer queues is minimized. Since the optimal policy for the repairman cannot be found analytically due to the correlations in the queue lengths, a near-optimal policy is proposed. This is obtained by combining intuition and results from queueing theory with techniques from Markov decision theory. Specifically, the relative value functions for several policies for which the model can be decomposed in less complicated subsystems are studied, and the results are combined with the classic one-step policy improvement algorithm. The resulting policy is easy to apply, is scalable in the number of machines, and is shown to be highly accurate over a wide range of parameter settings. Keywords: Layered queueing networks, Markov decision processes, one-step policy improvement, near-optimal policies

AB - This article considers an extension of the classic machine-repair problem. The machines, apart from receiving service from a single repairman, now also supply service themselves to queues of products. The extended model can be viewed as a two-layered queueing network, in which the queues of products in the first layer are generally correlated, due to the fact that the machines have to share the repairman’s capacity in the second layer. Of particular interest is the dynamic control problem of how the repairman should allocate his/her capacity to the machines at any point in time so that the long-term average (weighted) sum of the queue lengths of the first-layer queues is minimized. Since the optimal policy for the repairman cannot be found analytically due to the correlations in the queue lengths, a near-optimal policy is proposed. This is obtained by combining intuition and results from queueing theory with techniques from Markov decision theory. Specifically, the relative value functions for several policies for which the model can be decomposed in less complicated subsystems are studied, and the results are combined with the classic one-step policy improvement algorithm. The resulting policy is easy to apply, is scalable in the number of machines, and is shown to be highly accurate over a wide range of parameter settings. Keywords: Layered queueing networks, Markov decision processes, one-step policy improvement, near-optimal policies

U2 - 10.1080/0740817X.2014.928962

DO - 10.1080/0740817X.2014.928962

M3 - Article

VL - 47

SP - 392

EP - 413

JO - IIE Transactions

JF - IIE Transactions

SN - 0740-817X

IS - 4

ER -