Open problem: M/G/k/SRPT under medium load

DOI10.1287/STSY.2019.0042zbMATH Open1447.60136OpenAlexW2974300944MaRDI QIDQ5113904FDOQ5113904

Authors: Isaac Grosof 

Publication date: 18 June 2020

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

Full work available at URL: https://doi.org/10.1287/stsy.2019.0042

Recommendations

• On the average sojourn time under \(M/M/1/\)SRPT
• New results on competitive analysis of online SRPT scheduling
• Online scheduling on identical machines using SRPT
• scientific article; zbMATH DE number 2080856
• Open problem: Size-based scheduling with estimation errors

zbMATH Keywords

optimizationcontrolstochastic networks

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Multi-server queueing systems with multiple priority classes
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• SEH: size estimate hedging for single-server 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
• SEH: size estimate hedging scheduling of queues
• Open problem: Size-based scheduling with estimation errors
• Title not available (Why is that?)
• On the average sojourn time under \(M/M/1/\)SRPT
• New results on competitive analysis of online SRPT scheduling

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)