Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue

DOI10.1007/PL00003992zbMath0947.90027OpenAlexW2088833086MaRDI QIDQ1298728

Mark P. Van Oyen, Eungab Kim

Publication date: 5 October 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00003992

zbMATH Keywords

finite bufferstochastic schedulingthreshold policypolling system\(c\mu\) ruleloss penalty

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (8)

Optimal inventory replenishment policy for a queueing system with finite waiting room capacity ⋮ Marginal productivity index policies for scheduling a multiclass delay-/loss-sensitive queue ⋮ Optimal purchasing policy in a two-component assembly system with different purchasing contracts for each component ⋮ Stochastic vendor managed replenishment with demand dependent shipment. ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Mathematical methods to study the polling systems ⋮ Structural results on a batch acceptance problem for capacitated queues ⋮ Optimal control of a flexible server

This page was built for publication: Beyond the \(c\mu\) rule: Dynamic scheduling of a two-class loss queue