Pages that link to "Item:Q1383321"

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

Displaying 14 items.

• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
• The museum visitor routing problem (Q969135) (← links)
• A tabu search algorithm for the open shop scheduling problem (Q1302574) (← links)
• A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• Local search with constraint propagation and conflict-based heuristics (Q1606115) (← 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)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
• A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
• A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
• The path-repair algorithm (Q2741380) (← links)