An improved NEH-based heuristic for the permutation flowshop problem

DOI10.1016/J.COR.2007.05.005MaRDI QIDQ925842zbMATH OpenOpenAlexFDO

Authors Xingye Dong, Houkuan Huang, Ping Chen

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

zbMATH Keywords

flowshopheuristicmakespanscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An improved NEH heuristic to minimize makespan in permutation flow shops
• On recent modifications and extensions of the NEH heuristic for flow shop sequencing
• \(N\)-NEH+ algorithm for solving permutation flow shop problems
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• A New Heuristic Method for the Permutation Flow Shop Scheduling Problem

Cites work

• A comprehensive review and evaluation of permutation flowshop heuristics
• A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A high quality solution constructive heuristic for flow shop sequencing
• A new constructive heuristic for the flowshop scheduling problem
• An Evaluation of Flow Shop Sequencing Heuristics
• Benchmarks for basic scheduling problems
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Optimal two- and three-stage production schedules with set-up time included
• Some efficient heuristic methods for the flow shop sequencing problem
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(37)

• An empirical analysis of the optimality rate of flow shop heuristics
• The distributed permutation flowshop scheduling problem
• A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
• Iterative beam search algorithms for the permutation flowshop
• New efficient heuristics for scheduling open shops with makespan minimization
• Solving permutation flow shop scheduling problem with sequence-independent setup time
• The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
• A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
• Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
• 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
• On recent modifications and extensions of the NEH heuristic for flow shop sequencing
• New hard benchmark for flowshop scheduling problems minimising makespan
• 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 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
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• 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
• The seeds of the NEH algorithm: an overview using bibliometric analysis
• Deterministic constructive N-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
• Mip-based local search for permutation flowshop scheduling with makespan objective
• Advanced metaheuristics for bi-criteria optimization in a distributed blocking flow shop problem with setup times
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

This page was built for publication: An improved NEH-based heuristic for the permutation flowshop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925842)