Pages that link to "Item:Q2379930"

The following pages link to New approximation bounds for LPT scheduling (Q2379930):

Displaying 10 items.

• Coordination mechanisms with hybrid local policies (Q408369) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
• Scheduling with uncertain processing times in mixed-criticality systems (Q2315625) (← 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)
• A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← 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)