Pages that link to "Item:Q2910853"
From MaRDI portal
The following pages link to Universal Sequencing on an Unreliable Machine (Q2910853):
Displaying 12 items.
- Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
- Distributionally robust appointment scheduling with moment-based ambiguity set (Q1728172) (← links)
- The TV advertisements scheduling problem (Q1733325) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- Optimal algorithms for scheduling under time-of-use tariffs (Q2241552) (← links)
- Speed-robust scheduling: sand, bricks, and rocks (Q2689830) (← links)
- Optimal Algorithms and a PTAS for Cost-Aware Scheduling (Q2946391) (← links)
- Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q5346558) (← links)
- Scheduling with speed predictions (Q6574930) (← links)
