Pages that link to "Item:Q433121"

The following pages link to An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule (Q433121):

Displaying 3 items.

• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
• (Q3304142) (← links)
• On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems (Q4649211) (← links)