Pages that link to "Item:Q287130"
From MaRDI portal
The following pages link to A lower bound for randomized on-line multiprocessor scheduling (Q287130):
Displaying 23 items.
- Semi-online scheduling revisited (Q442235) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Randomized on-line scheduling on three processors. (Q1417594) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
