An improved NEH heuristic to minimize makespan in permutation flow shops
From MaRDI portal
Publication:2475856
DOI10.1016/j.cor.2007.01.020zbMath1144.90499OpenAlexW2015178471MaRDI QIDQ2475856
Jerzy Kamburowski, Pawel Jan Kalczynski
Publication date: 11 March 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.01.020
Programming involving graphs or networks (90C35) 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 ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ 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 ⋮ Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem ⋮ \(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 ⋮ Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization ⋮ 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 ⋮ A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on permutation flow shop problem
- New results in the worst-case analysis for flow-shop scheduling
- Some efficient heuristic methods for the flow shop sequencing problem
- Permutation vs. non-permutation flow shop schedules
- A fast tabu search algorithm for the permutation flow-shop problem
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A genetic algorithm for flowshop sequencing
- New heuristics for no-wait flowshops to minimize makespan.
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Non-bottleneck machines in three-machine flow shops
- The permutation flow shop with buffers: A tabu search approach
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
- A neuro-tabu search heuristic for the flow shop scheduling problem
- Benchmarks for basic scheduling problems
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Performance guarantees for flowshop heuristics to minimize makespan
- Optimal two- and three-stage production schedules with setup times included
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- A survey and evaluation of static flowshop scheduling heuristics
- A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees
- An Evaluation of Flow Shop Sequencing Heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- A high quality solution constructive heuristic for flow shop sequencing
- A branch-and-bound-based local search method for the flow shop problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Mathematical aspects of the 3 × n job-shop sequencing problem
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- Flowshop-scheduling problems with makespan criterion: a review
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
