Pages that link to "Item:Q1847208"

The following pages link to A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208):

Displaying 12 items.

• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← 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)
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
• An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
• On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling (Q2108101) (← links)
• Simplifying dispatching rules in genetic programming for dynamic job shop scheduling (Q2163788) (← links)
• Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
• Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)