Pages that link to "Item:Q2117694"
From MaRDI portal
The following pages link to Explorable uncertainty in scheduling with non-uniform testing times (Q2117694):
Displaying 6 items.
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Round-competitive algorithms for uncertainty problems with parallel queries (Q2684483) (← links)
- Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time (Q6492085) (← links)
- The power of amortization on scheduling with explorable uncertainty (Q6574932) (← links)