The seeds of the NEH algorithm: an overview using bibliometric analysis
From MaRDI portal
Publication:6200788
DOI10.1007/s43069-023-00276-7MaRDI QIDQ6200788
Nádia Junqueira Martarelli Fróes, Levi Ribeiro de Abreu, Bruno de Athayde Prata, Marcelo Seido Nagano
Publication date: 20 February 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) History of operations research and mathematical programming (90-03) Bibliographic studies (01A90)
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Energy-efficient scheduling in manufacturing companies: a review and research framework
- 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 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
- Some efficient heuristic methods for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
- A genetic algorithm for flowshop sequencing
- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- Insertion techniques for the heuristic solution of the job shop problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Green scheduling, flows and matchings
- Benchmarks for basic scheduling problems
- A survey of scheduling with controllable processing times
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: The seeds of the NEH algorithm: an overview using bibliometric analysis