Pages that link to "Item:Q2356126"

The following pages link to A note on the Coffman-Sethi bound for LPT scheduling (Q2356126):

Displaying 6 items.

• A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem (Q282256) (← 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)
• A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
• A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)