An improved NEH-based heuristic for the permutation flowshop problem
From MaRDI portal
Publication:925842
DOI10.1016/j.cor.2007.05.005zbMath1278.90150OpenAlexW2086738348MaRDI QIDQ925842
Xingye Dong, Ping Chen, Houkuan Huang
Publication date: 23 May 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.05.005
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ New efficient heuristics for scheduling open shops with makespan minimization ⋮ On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant ⋮ \(N\)-NEH+ algorithm for solving permutation flow shop problems ⋮ New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems ⋮ Assembly flowshop scheduling problem: speed-up procedure and computational evaluation ⋮ An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems ⋮ Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The distributed permutation flowshop scheduling problem ⋮ A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- Some efficient heuristic methods for the flow shop sequencing problem
- A new constructive heuristic for the flowshop scheduling problem
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- A high quality solution constructive heuristic for flow shop sequencing
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
