Aarhus University Seal / Aarhus Universitets segl

Computation of a near-optimal service policy for a single-server queue with homogeneous jobs

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. / Johansen, Søren Glud; Larsen, Christian.

In: European Journal of Operational Research, Vol. 134, No. 3, 2001, p. 648-663.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

Johansen, SG & Larsen, C 2001, 'Computation of a near-optimal service policy for a single-server queue with homogeneous jobs', European Journal of Operational Research, vol. 134, no. 3, pp. 648-663.

APA

Johansen, S. G., & Larsen, C. (2001). Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. European Journal of Operational Research, 134(3), 648-663.

CBE

Johansen SG, Larsen C. 2001. Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. European Journal of Operational Research. 134(3):648-663.

MLA

Johansen, Søren Glud and Christian Larsen. "Computation of a near-optimal service policy for a single-server queue with homogeneous jobs". European Journal of Operational Research. 2001, 134(3). 648-663.

Vancouver

Johansen SG, Larsen C. Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. European Journal of Operational Research. 2001;134(3):648-663.

Author

Johansen, Søren Glud ; Larsen, Christian. / Computation of a near-optimal service policy for a single-server queue with homogeneous jobs. In: European Journal of Operational Research. 2001 ; Vol. 134, No. 3. pp. 648-663.

Bibtex

@article{63984e7024fe11da834f000ea68e967b,
title = "Computation of a near-optimal service policy for a single-server queue with homogeneous jobs",
abstract = "We present an algorithm for computing a near-optimal service policy for a single-server queueing system when the service cost is a convex function of the service time. The policy has state-dependent service times, and it includes the options to remove jobs from the system and to let the server be off. The systems' semi-Markov decision model has infinite action sets for the positive states. We design a new tailor-made policy-iteration algorithm for computing a policy for which the long-run average cost is at most a positive tolerance above the minimum average cost. For any positive tolerance our algorithm computes the desired policy in a finite (and small) number of iterations. The number is five for the numerical example used in the paper to illustrate results obtained by the algorithm.",
keywords = "Control, Service, Markov processes, Queueing, HH{\AA} forskning, Control, Service, Markov processes, Queueing, HH{\AA} forskning",
author = "Johansen, {S{\o}ren Glud} and Christian Larsen",
note = "Artiklen haves i ringbind p{\aa} L{\ae}sesalen - Research@asb",
year = "2001",
language = "English",
volume = "134",
pages = "648--663",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier BV",
number = "3",

}

RIS

TY - JOUR

T1 - Computation of a near-optimal service policy for a single-server queue with homogeneous jobs

AU - Johansen, Søren Glud

AU - Larsen, Christian

N1 - Artiklen haves i ringbind på Læsesalen - Research@asb

PY - 2001

Y1 - 2001

N2 - We present an algorithm for computing a near-optimal service policy for a single-server queueing system when the service cost is a convex function of the service time. The policy has state-dependent service times, and it includes the options to remove jobs from the system and to let the server be off. The systems' semi-Markov decision model has infinite action sets for the positive states. We design a new tailor-made policy-iteration algorithm for computing a policy for which the long-run average cost is at most a positive tolerance above the minimum average cost. For any positive tolerance our algorithm computes the desired policy in a finite (and small) number of iterations. The number is five for the numerical example used in the paper to illustrate results obtained by the algorithm.

AB - We present an algorithm for computing a near-optimal service policy for a single-server queueing system when the service cost is a convex function of the service time. The policy has state-dependent service times, and it includes the options to remove jobs from the system and to let the server be off. The systems' semi-Markov decision model has infinite action sets for the positive states. We design a new tailor-made policy-iteration algorithm for computing a policy for which the long-run average cost is at most a positive tolerance above the minimum average cost. For any positive tolerance our algorithm computes the desired policy in a finite (and small) number of iterations. The number is five for the numerical example used in the paper to illustrate results obtained by the algorithm.

KW - Control

KW - Service

KW - Markov processes

KW - Queueing

KW - HHÅ forskning

KW - Control

KW - Service

KW - Markov processes

KW - Queueing

KW - HHÅ forskning

M3 - Journal article

VL - 134

SP - 648

EP - 663

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -