Pages that link to "Item:Q2572856"
From MaRDI portal
The following pages link to Performance guarantees for flowshop heuristics to minimize makespan (Q2572856):
Displaying 4 items.
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← 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)
