Pages that link to "Item:Q4210081"
From MaRDI portal
The following pages link to Bounding the Power of Preemption in Randomized Scheduling (Q4210081):
Displayed 15 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- On-line scheduling of equal-length intervals on parallel machines (Q436333) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Scheduling maintenance jobs in networks (Q1628599) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Improved Randomized Results for That Interval Selection Problem (Q3541101) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)