Pages that link to "Item:Q1970423"
From MaRDI portal
The following pages link to A lower bound for on-line scheduling on uniformly related machines (Q1970423):
Displaying 26 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Online algorithms for scheduling with machine activation cost on two uniform machines (Q886402) (← 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)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A lower bound for randomized on-line scheduling algorithms (Q1336752) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- Pseudo lower bounds for online parallel machine scheduling (Q1785411) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Heuristics and augmented neural networks for task scheduling with non-identical machines (Q2432852) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- (Q5009506) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
