The seeds of the NEH algorithm: an overview using bibliometric analysis
From MaRDI portal
Publication:6200788
Recommendations
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- An improved NEH heuristic to minimize makespan in permutation flow shops
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- An improved NEH-based heuristic for the permutation flowshop problem
- Fifty years of scheduling: a survey of milestones
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flowshop sequencing
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A survey of scheduling with controllable processing times
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Benchmarks for basic scheduling problems
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Energy-efficient scheduling in manufacturing companies: a review and research framework
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Green scheduling, flows and matchings
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Insertion techniques for the heuristic solution of the job shop problem
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Optimization by simulated annealing
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
This page was built for publication: The seeds of the NEH algorithm: an overview using bibliometric analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200788)
