When does the \(c\mu \) rule apply to finite-population queueing systems?

DOI10.1016/J.ORL.2004.05.009zbMath1140.90357OpenAlexW2083562133MaRDI QIDQ1779711

Seyed M. R. Iravani, Bora Kolfal

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.05.009

zbMATH Keywords

PreemptionPriority assignmentOptimal scheduling\(c\mu\) ruleFinite-source queueMachine repairman problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (8)

Optimal control of a single server in a finite-population queueing network ⋮ Optimal selection of the service rate for a finite input source fuzzy queuing system ⋮ A survey of the machine interference problem ⋮ Optimal server scheduling in nonpreemptive finite-population queueing systems ⋮ Scheduling policies for a repair shop problem ⋮ On the optimal control of a two-queue polling model ⋮ A 2-class maintenance model with dynamic server behavior ⋮ Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration

Cites Work

• Unnamed Item
• Unnamed Item
• Markov-modulated finite-source queueing models and their applications
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• On the optimal policies of an exponential machine repair problem
• Optimal Repair Allocation in a Series System
• On the optimal assignment of servers and a repairman

This page was built for publication: When does the \(c\mu \) rule apply to finite-population queueing systems?