Open Problem—M/G/1 Scheduling with Preemption Delays

DOI10.1287/STSY.2019.0047zbMATH Open1446.60074OpenAlexW2973348615MaRDI QIDQ5113909FDOQ5113909

Ziv Scully

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.0047

zbMATH Keywords

optimizationcontrolschedulingstochastic networks\(M/G/1\)

Mathematics Subject Classification ID

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

Cites Work

• Multi‐Armed Bandit Allocation Indices
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Polling Models With and Without Switchover Times
• Introduction to Queueing
• Title not available (Why is that?)
• On stochastic scheduling with precedence relations and switching costs
• Optimality of index policies for stochastic scheduling with switching penalties
• Multi-armed bandits with switching penalties

Cited In (1)

• Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Open Problems in Throughput Scheduling 👍 👎
• On the complexity of preemptive openshop scheduling problems 👍 👎
• Open problems in real-time scheduling 👍 👎
• On the complexity of preemptive open-shop scheduling problems 👍 👎
• Complexity and approximation for precedence constrained scheduling problems with large communication delays 👍 👎
• Pre-emptive scheduling problems with controllable processing times 👍 👎

This page was built for publication: Open Problem—M/G/1 Scheduling with Preemption Delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113909)