Open problem: M/G/k/SRPT under medium load
From MaRDI portal
Publication:5113904
Recommendations
Cites work
- scientific article; zbMATH DE number 994723 (Why is no real title available?)
- scientific article; zbMATH DE number 3316606 (Why is no real title available?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Multi-server queueing systems with multiple priority classes
- On Markov-Krein characterization of the mean waiting time in \(M/G/K\) and other queueing systems
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
Cited in
(8)- scientific article; zbMATH DE number 2080856 (Why is no real title available?)
- SEH: size estimate hedging for single-server queues
- On the average sojourn time under \(M/M/1/\)SRPT
- New results on competitive analysis of online SRPT scheduling
- SEH: size estimate hedging scheduling of queues
- Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018
- The SRPT service policy with frequency scaling: modeling, evaluation and optimization
- Open problem: Size-based scheduling with estimation errors
This page was built for publication: Open problem: \(M/G/k/SRPT\) under medium load
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113904)