Pages that link to "Item:Q1363647"

The following pages link to Exact and approximation algorithms for makespan minimization on unrelated parallel machines (Q1363647):

Displaying 15 items.

• A heuristic and a branch-and-bound algorithm for the assembly line worker assignment and balancing problem (Q336970) (← links)
• 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)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
• The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
• Modeling and solving rich quay crane scheduling problems (Q1761126) (← links)
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848) (← links)
• Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
• A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• A branch-and-bound algorithm for assembly line worker assignment and balancing problems (Q2257352) (← links)
• Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)