\(M/G/1/\mathrm{MLPS}\) compared with \(M/G/1/\mathrm{PS}\) within service time distribution class IMRL
From MaRDI portal
Publication:857944
DOI10.1007/s00186-006-0080-6zbMath1132.90371MaRDI QIDQ857944
Publication date: 5 January 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0080-6
scheduling; M/G/1; IMRL; PS; MLPS
90C35: Programming involving graphs or networks
Related Items
Cites Work
- Unnamed Item
- Processor-sharing queues: Some progress in analysis
- Bandwidth sharing and admission control for elastic traffic
- A survey on statistical bandwidth sharing
- \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
- Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures
- On extremal service disciplines in single-stage queueing systems
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline