Pages that link to "Item:Q2489956"

The following pages link to Designing PTASs for MIN-SUM scheduling problems (Q2489956):

Displaying 3 items.

• Approximability of average completion time scheduling on unrelated machines (Q507314) (← links)
• Competitive analysis of preemptive single-machine scheduling (Q614049) (← links)
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)