The following pages link to (Q4952670):
Displayed 18 items.
- Semi-online scheduling revisited (Q442235) (← links)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
- Semi-on-line multiprocessor scheduling with given total processing time (Q557814) (← links)
- Online scheduling with rejection and withdrawal (Q650898) (← links)
- Online scheduling with a buffer on related machines (Q711400) (← links)
- List's worst-average-case or WAC ratio (Q835596) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- Applying extra-resource analysis to load balancing. (Q1588056) (← links)
- On-line scheduling revisited (Q1592757) (← links)
- Minimizing the maximum starting time on-line (Q1763375) (← links)
- Online makespan minimization with parallel schedules (Q2362356) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Improved lower bounds for the online bin stretching problem (Q2399609) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Load balancing of temporary tasks in the \(\ell _{p}\) norm (Q2503355) (← links)