The following pages link to (Q3641987):
Displaying 4 items.
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
- A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem (Q1819236) (← links)
- Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
- A computational study of heuristics for two-stage flexible flowshops (Q4230155) (← links)
