Pages that link to "Item:Q1777158"
From MaRDI portal
The following pages link to A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158):
Displayed 5 items.
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)