On robust online scheduling algorithms
From MaRDI portal
Recommendations
- On the Robustness of Graham’s Algorithm for Online Scheduling
- On-line scheduling revisited
- Preemptive online algorithms for scheduling
- Stochastic Online Scheduling Revisited
- Competitive algorithms for multistage online scheduling
- An experimental study of online scheduling algorithms
- On-line Scheduling with Optimal Worst-Case Response Time
- Models and Algorithms for Stochastic Online Scheduling
- Robust algorithms for preemptive scheduling
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- A new average case analysis for completion time scheduling
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- Approximation in stochastic scheduling
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Models and Algorithms for Stochastic Online Scheduling
- Network flows. Theory, algorithms, and applications.
- On randomized online scheduling
- On-line scheduling revisited
- Parallel Machine Scheduling with Uncertain Communication Delays
- Robust discrete optimization and its applications
- Robust optimization-methodology and applications
- Sensitivity analysis for scheduling problems
- Sensitivity analysis of list scheduling heuristics
- Sensitivity analysis of scheduling algorithms
- Sensitivity bounds for machine scheduling with uncertain communication delays
Cited in
(5)- Robust optimization in the presence of uncertainty: a generic approach
- A survey on makespan minimization in semi-online environments
- Models and Algorithms for Stochastic Online Scheduling
- Comparing deterministic, robust and online scheduling using entropy
- On the Robustness of Graham’s Algorithm for Online Scheduling
This page was built for publication: On robust online scheduling algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539452)