Pages that link to "Item:Q6047866"
From MaRDI portal
The following pages link to On some lower bounds for the permutation flowshop problem (Q6047866):
Displaying 3 items.
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
