A high quality solution constructive heuristic for flow shop sequencing
From MaRDI portal
Recommendations
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- A new constructive heuristic for the flowshop scheduling problem
- A new heuristic for the n-job, M-machine flow-shop problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Some efficient heuristic methods for the flow shop sequencing problem
Cited in
(20)- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A new heuristic method for the flow shop sequencing problem
- A new constructive heuristic for the 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
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- Iterative beam search algorithms for the permutation flowshop
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- A new heuristic for the n-job, M-machine flow-shop problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Sequencing CONWIP flow-shops: Analysis and heuristics
- Deterministic constructive N-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
This page was built for publication: A high quality solution constructive heuristic for flow shop sequencing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656763)
