Pages that link to "Item:Q1310023"
From MaRDI portal
The following pages link to Worst-case analysis of heuristics for open shops with parallel machines (Q1310023):
Displaying 9 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← 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)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- A note on LPT scheduling (Q5906502) (← links)
