Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
New hard benchmark for flowshop scheduling problems minimising makespan
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Some efficient heuristic methods for the flow shop sequencing problem
An improved NEH-based heuristic for the permutation flowshop problem
Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
Cooperative metaheuristics for the permutation flowshop scheduling problem
An empirical analysis of the optimality rate of flow shop heuristics
The distributed permutation flowshop scheduling problem
A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Parallel hybrid heuristics for the permutation flow shop problem
A comprehensive review and evaluation of permutation flowshop heuristics
A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
Benchmarks for basic scheduling problems
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
An improved NEH heuristic to minimize makespan in permutation flow shops
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
Just-in-time scheduling for a distributed concrete precast flow shop system
\(N\)-NEH+ algorithm for solving permutation flow shop problems
Optimal two- and three-stage production schedules with set-up time included
The Complexity of Flowshop and Jobshop Scheduling
A high quality solution constructive heuristic for flow shop sequencing
Artificial Intelligence and Soft Computing - ICAISC 2004
Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers

This page was built for publication: Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion

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