Pages that link to "Item:Q1302574"

The following pages link to A tabu search algorithm for the open shop scheduling problem (Q1302574):

Displaying 17 items.

• Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (Q707776) (← links)
• The museum visitor routing problem (Q969135) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← 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 tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• (Q2741380) (← links)
• A new particle swarm optimization for multi-objective open shop scheduling (Q2903242) (← links)
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM (Q4650620) (← 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)