The seeds of the NEH algorithm: an overview using bibliometric analysis

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Bibliographic studies (01A90) History of operations research and mathematical programming (90-03)

Cites Work

Optimization by simulated annealing
A survey of scheduling with controllable processing times
Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Tabu search for total tardiness minimization in flowshop scheduling problems
A genetic algorithm for flowshop sequencing
Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
A fast tabu search algorithm for the permutation flow-shop problem
A comprehensive review and evaluation of permutation flowshop heuristics
Benchmarks for basic scheduling problems
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Some efficient heuristic methods for the flow shop sequencing 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
Energy-efficient scheduling in manufacturing companies: a review and research framework
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
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
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
Insertion techniques for the heuristic solution of the job shop problem
Green scheduling, flows and matchings
Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling

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)