Pages that link to "Item:Q5954097"
From MaRDI portal
The following pages link to Linear time approximation scheme for the multiprocessor open shop problem (Q5954097):
Displayed 13 items.
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- Scheduling open shops with parallel machines to minimize total completion time (Q609214) (← links)
- A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← 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 linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- Open block scheduling in optical communication networks (Q2503353) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)