Pages that link to "Item:Q2283006"
From MaRDI portal
The following pages link to Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006):
Displaying 3 items.
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
