Optimal server scheduling in nonpreemptive finite-population queueing systems

DOI10.1007/s11134-006-9006-5zbMath1178.60065OpenAlexW2117617285MaRDI QIDQ877789

Seyed M. R. Iravani, Vijayalakshmi Krishnamurthy, Gary H. Chao

Publication date: 3 May 2007

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-9006-5

zbMATH Keywords

Markov decision processFinite population queueing systemsMachine-interference problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

Related Items

Optimal control of a single server in a finite-population queueing network, Scheduling policies for a repair shop problem, Analysis of the optimal resource allocation for a tandem queueing system, A 2-class maintenance model with dynamic server behavior

Cites Work

• Unnamed Item
• When does the \(c\mu \) rule apply to finite-population queueing systems?
• A Numerical Method to Obtain the Equilibrium Results for the Multiple Finite Source Priority Queueing Model
• On the optimal policies of an exponential machine repair problem
• Serving process with least thinking time maximizes resource utilization
• A Study of Multiple Finite-Source Queueing Models
• On the optimal assignment of servers and a repairman
• An Optimum Repair Policy for the Machine Interference Problem
• Optimal policies for machine repairmen problems
• Optimal policies for scheduling repairs and allocating heterogeneous servers