Pages that link to "Item:Q2379930"
From MaRDI portal
The following pages link to New approximation bounds for LPT scheduling (Q2379930):
Displaying 21 items.
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm (Q1008788) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- The exact LPT-bound for maximizing the minimum completion time (Q1196214) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← links)
- A note on the Coffman-Sethi bound for LPT scheduling (Q2356126) (← links)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- A note on LPT scheduling (Q5906502) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
