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

  • Department of Business Studies
  • CORAL - Centre for Operations Research Applications in Logistics
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.
Original languageEnglish
JournalEuropean Journal of Operational Research
Pages (from-to)648-663
Number of pages16
Publication statusPublished - 2001

    Research areas

  • Control, Service, Markov processes, Queueing, HHÅ forskning

See relations at Aarhus University Citationformats

ID: 32319382