Pages that link to "Item:Q2289001"

The following pages link to Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001):

Displaying 3 items.

• A bi-objective heuristic approach for green identical parallel machine scheduling (Q2029023) (← links)
• Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
• Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan (Q6594026) (← links)