Pages that link to "Item:Q1960317"

The following pages link to A new lower bound for the open-shop problem (Q1960317):

Displaying 21 items.

• A contribution and new heuristics for open shop scheduling (Q733548) (← links)
• Compiling finite linear CSP into SAT (Q842794) (← links)
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
• Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
• Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
• New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• A column generation-based heuristic for a rehabilitation patient scheduling and routing problem (Q2676370) (← links)
• An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
• A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
• A study on open shop scheduling to minimise total tardiness (Q2967576) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
• A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
• A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)