Pages that link to "Item:Q1167065"
From MaRDI portal
The following pages link to Scheduling open shops with parallel machines (Q1167065):
Displaying 10 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← 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)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171) (← links)
