Pages that link to "Item:Q4993294"
From MaRDI portal
The following pages link to Scheduling with explorable uncertainty (Q4993294):
Displaying 16 items.
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online makespan minimization with budgeted uncertainty (Q832833) (← links)
- Scheduling search procedures: The wheel of fortune (Q880568) (← links)
- Computing and scheduling with explorable uncertainty (Q1670736) (← links)
- Scheduling with a processing time oracle (Q2109845) (← links)
- Explorable uncertainty in scheduling with non-uniform testing times (Q2117694) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- (Q2753722) (← links)
- Query-Competitive Sorting with Uncertainty. (Q5092365) (← links)
- Euro-Par 2004 Parallel Processing (Q5311383) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← 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)