Pages that link to "Item:Q4367269"
From MaRDI portal
The following pages link to A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines (Q4367269):
Displayed 10 items.
- Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- Semi-online machine covering for two uniform machines (Q1034625) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)