Pages that link to "Item:Q2450907"

The following pages link to A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907):

Displaying 9 items.

• Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
• A tabu search algorithm for the open shop scheduling problem (Q1302574) (← links)
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search (Q1374441) (← links)
• A tabu search algorithm for the open shop problem (Q1383321) (← links)
• Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)