Pages that link to "Item:Q1861922"

The following pages link to Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem (Q1861922):

Displaying 9 items.

• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
• Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint (Q1653364) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
• Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem (Q2273695) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)