New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
From MaRDI portal
Publication:2668784
Recommendations
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- An improved NEH heuristic to minimize makespan in permutation flow shops
Cites work
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A comprehensive review and evaluation of permutation flowshop heuristics
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A high quality solution constructive heuristic for flow shop sequencing
- A new constructive heuristic for the flowshop scheduling problem
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- An Evaluation of Flow Shop Sequencing Heuristics
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- Benchmarks for basic scheduling problems
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Optimal two- and three-stage production schedules with set-up time included
- Some efficient heuristic methods for the flow shop sequencing problem
Cited in
(6)- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- 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
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
This page was built for publication: New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668784)
