Pages that link to "Item:Q1010271"
From MaRDI portal
The following pages link to A genetic algorithm for the proportionate multiprocessor open shop (Q1010271):
Displaying 13 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
- Competitive genetic algorithms for the open-shop scheduling problem (Q1401639) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach (Q4661043) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
