The following pages link to (Q4252706):
Displaying 28 items.
- The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
- On the advice complexity of online bipartite matching and online stable marriage (Q402379) (← links)
- Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms (Q497994) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling (Q1033671) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors (Q1645215) (← links)
- Online knapsack with resource augmentation (Q1675784) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- An approximation algorithm for scheduling trees of malleable tasks (Q1848358) (← links)
- Deadline-based scheduling of periodic task systems on multiprocessors. (Q1853117) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- Online bin packing with resource augmentation (Q2427692) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- An analysis of totally clairvoyant scheduling (Q2464437) (← links)
- Greedy multiprocessor server scheduling (Q2466596) (← links)
- Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
- Optimal on-line flow time with resource augmentation (Q2489955) (← links)
- Speed is more powerful than clairvoyance (Q5054861) (← links)
- Measuring the problem-relevant information in input (Q5321779) (← links)
- A Constant-Competitive Algorithm for Online OVSF Code Assignment (Q5387778) (← links)
- (Q5743472) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
- Scheduling in the dark (Q5918075) (← links)
