Pages that link to "Item:Q2211361"
From MaRDI portal
The following pages link to An adversarial model for scheduling with testing (Q2211361):
Displaying 11 items.
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Speed-robust scheduling. Sand, bricks, and rocks (Q2061889) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Speed-robust scheduling: sand, bricks, and rocks (Q2689830) (← links)
- Dynamic scheduling with uncertain job types (Q6167855) (← links)
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time (Q6492085) (← links)
