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

DOI10.1016/S0377-2217(00)00290-3zbMath0984.90008OpenAlexW2142817194WikidataQ127806825 ScholiaQ127806825MaRDI QIDQ5952514

Christian Larsen, Søren Glud Johansen

Publication date: 14 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00290-3

zbMATH Keywords

Markov processespolicy-iteration algorithmsemi-Markov decision modelservice policysingle-server queueing system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (4)

Optimal threshold policies in a two-class preemptive priority queue with admission and termination control ⋮ Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method ⋮ On the optimal allocation of service to impatient tasks ⋮ An Overview for Markov Decision Processes in Queues and Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control of the service process in a queueing system
• Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
• Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs
• On monotone optimal policies in a queueing model ofM/G/1 type with controllable service time distribution
• A Note on Optimal Service Selection in a Single Server Queue
• The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains
• Using a variable production rate as a response mechanism in the economic production lot size model

This page was built for publication: Computation of a near-optimal service policy for a single-server queue with homogeneous jobs