Pages that link to "Item:Q1179414"
From MaRDI portal
The following pages link to Parametric bounds for LPT scheduling on uniform processors (Q1179414):
Displaying 10 items.
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
- Scheduling on same-speed processors with at most one downtime on each machine (Q429662) (← links)
- Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
- Algorithms for handling skew in parallel task scheduling (Q1208591) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- An LPT-bound for a parallel multiprocessor scheduling problem (Q1910052) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- (Q3820021) (← links)
- A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines (Q4367269) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)