Pages that link to "Item:Q747046"

The following pages link to Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046):

Displaying 8 items.

• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
• 2-approximation algorithm for a generalization of scheduling on unrelated parallel machines (Q1799571) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
• An efficient approximation algorithm for minimizing makespan on uniformly related machines. (Q2775886) (← links)
• Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
• Approximation results for makespan minimization with budgeted uncertainty (Q5919095) (← links)