The following pages link to (Q4252341):
Displaying 15 items.
- Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278) (← links)
- Extra processors versus future information in optimal deadline scheduling (Q706313) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- The limited-preemptive feasibility of real-time tasks on uniprocessors (Q2356291) (← links)
- An improved algorithm for online machine minimization (Q2417064) (← links)
- A constant-approximate feasibility test for multiprocessor real-time scheduling (Q2428689) (← links)
- Meeting Deadlines: How Much Speed Suffices? (Q3012809) (← links)
- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling (Q3541088) (← links)
- Time-memory-processor trade-offs (Q3796743) (← links)
- An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization (Q4561244) (← links)
- Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing (Q4685726) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
