Pages that link to "Item:Q1943639"
From MaRDI portal
The following pages link to Approximation algorithms for parallel open shop scheduling (Q1943639):
Displaying 3 items.
- 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)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
