A fuzzy greedy heuristic for permutation flow-shop scheduling
From MaRDI portal
(Redirected from Publication:3582659)
Recommendations
- An improved NEH heuristic to minimize makespan in permutation flow shops
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- A new constructive heuristic for the flowshop scheduling 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
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
Cited in
(8)- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- An improved NEH heuristic to minimize makespan in permutation flow shops
- scientific article; zbMATH DE number 1982190 (Why is no real title available?)
- scientific article; zbMATH DE number 2050748 (Why is no real title available?)
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
This page was built for publication: A fuzzy greedy heuristic for permutation flow-shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582659)
