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

DOI10.1287/stsy.2019.0047zbMath1446.60074OpenAlexW2973348615MaRDI QIDQ5113909

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

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

Related Items (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

Cites Work

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

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