Pages that link to "Item:Q4367269"

The following pages link to A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines (Q4367269):

Displaying 23 items.

• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← links)
• Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
• Semi-online scheduling with known maximum job size on two uniform machines (Q613661) (← links)
• Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← 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)
• The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
• Parametric bounds for LPT scheduling on uniform processors (Q1179414) (← links)
• A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
• A note on MULTIFIT scheduling for uniform machines (Q1272356) (← links)
• A survey on makespan minimization in semi-online environments (Q1617278) (← links)
• Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
• Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
• The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
• Single parameter analysis of power of preemption on two and three uniform machines (Q2339808) (← links)
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem (Q2378450) (← links)
• New approximation bounds for LPT scheduling (Q2379930) (← links)
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
• (Q4368203) (← links)
• Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)