A new set of high-performing heuristics to minimise flowtime in permutation flowshops
From MaRDI portal
(Redirected from Publication:337260)
Recommendations
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Heuristics for permutation flow shop scheduling with batch setup times
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Benchmarks for basic scheduling problems
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some efficient heuristic methods for the flow shop sequencing problem
Cited in
(22)- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Iterative beam search algorithms for the permutation flowshop
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- An efficient local search for minimizing completion time variance in permutation flow shops
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- A comprehensive review and evaluation of permutation flowshop heuristics
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
This page was built for publication: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337260)
