K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
type: Item
instance of: scholarly article
title: K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
zbMATH Open document ID: 0568.60090
DOI: 10.1016/0167-6911(85)90037-4
published in: Systems \& Control Letters
publication date: 1985-01-01T00:00:00Z
review text: A discrete-time system of K competing queues with queue-dependent, geometric service requirements and arbitrary arrival patterns is studied. When the cost per time slot and per queue is linear in the queue size, it is shown that the policy that allocates service attention to the non- empty queue with the largest expected cost decrease per slot (the \(\mu\) c-rule) minimizes the expected discounted cost over an infinite horizon.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 3907527
zbMATH Keywords: competing queues
zbMATH Keywords: cost over an infinite horizon
author: John S. Baras
author: Dye-Jyun Ma
author: Armand M. Makowski
reviewed by: Erik A. van Doorn
MaRDI profile type: Publication
full work available at URL: 0167-6911(85)90037-4
OpenAlex ID: W2004964364
cites work: Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
cites work: The cμ rule revisited
cites work: Dynamic Scheduling of a Multiclass Queue: Discount Optimality
cites work: On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
cites work: Q3882215
Recommended article: Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
Recommended article: On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
Recommended article: \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
Recommended article: Performance and cost analysis of Geom/G/1 queue with exhaustive service rule and multiple vacations
Recommended article: The \(M/M/1+M\) queue with a utility-maximizing server
Recommended article: An optimal \(P_{\lambda}^{M}\)-service policy for an \(M/G/1\) queueing system
Recommended article: The µc-rule is not optimal in the second node of the tandem queue: a counterexample
Recommended article: An all geometric discrete-time multiserver queueing system
description: scientific article; zbMATH DE number 3907527