Universal sequencing on an unreliable machine
From MaRDI portal
Recommendations
Cited in
(16)- Minimizing worst-case and average-case makespan over scenarios
- Distributionally robust appointment scheduling with moment-based ambiguity set
- The TV advertisements scheduling problem
- Speed-robust scheduling. Sand, bricks, and rocks
- Optimal algorithms for scheduling under time-of-use tariffs
- Speed-robust scheduling: sand, bricks, and rocks
- Optimal algorithms and a PTAS for cost-aware scheduling
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- Dual techniques for scheduling on a machine with varying speed
- Universal sequencing on a single machine
- Submodular maximization with uncertain knapsack capacity
- Packing a knapsack of unknown capacity
- A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
- Scheduling with speed predictions
- Speed-robust scheduling revisited
- Scheduling with speed predictions
This page was built for publication: Universal sequencing on an unreliable machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910853)