Pages that link to "Item:Q2668738"
From MaRDI portal
The following pages link to \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738):
Displaying 6 items.
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling (Q2627803) (← links)
- Fleet and charging infrastructure decisions for fast-charging city electric bus service (Q2669545) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)