\(N\)-NEH+ algorithm for solving permutation flow shop problems
From MaRDI portal
Publication:2668738
DOI10.1016/J.COR.2021.105296OpenAlexW3150803103MaRDI QIDQ2668738
Adam Stawowy, Jerzy Duda, Iwona Skalna, Radosław Puka
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105296
Related Items (1)
Cites Work
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- An empirical analysis of the optimality rate of flow shop heuristics
- A new constructive heuristic for the flowshop scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Optimal two- and three-stage production schedules with setup times included
- The Complexity of Flowshop and Jobshop Scheduling
- A high quality solution constructive heuristic for flow shop sequencing
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
This page was built for publication: \(N\)-NEH+ algorithm for solving permutation flow shop problems
