The following pages link to Tomáš Ebenlendr (Q537920):
Displayed 14 items.
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382) (← links)
- Online Scheduling of Equal-Length Jobs on Parallel Machines (Q3527232) (← links)
- (Q3579372) (← links)
- Semi-online Preemptive Scheduling: Study of Special Cases (Q3583568) (← links)
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines (Q3602828) (← links)
- STACS 2004 (Q5309700) (← links)
- (Q5389990) (← links)
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds (Q5449539) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)