Open Problem—M/G/1 Scheduling with Preemption Delays
From MaRDI portal
Publication:5113909
Recommendations
- scientific article; zbMATH DE number 3883928
- scientific article; zbMATH DE number 1820024
- scientific article; zbMATH DE number 2156264
- 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
Cites work
- scientific article; zbMATH DE number 3474804 (Why is no real title available?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- Multi-armed bandits with switching penalties
- On stochastic scheduling with precedence relations and switching costs
- Optimality of index policies for stochastic scheduling with switching penalties
- Performance modeling and design of computer systems. Queueing theory in action
- Polling Models With and Without Switchover Times
Cited in
(2)
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)