A new set of high-performing heuristics to minimise flowtime in permutation flowshops
From MaRDI portal
Publication:337260
DOI10.1016/J.COR.2014.08.004zbMATH Open1348.90257OpenAlexW2085370067MaRDI QIDQ337260FDOQ337260
Authors: Victor Fernandez-Viagas, Jose M. Framinan 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.004
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Benchmarks for basic scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Some efficient heuristic methods for the flow shop sequencing problem
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- New Search Spaces for Sequencing Problems with Application to Job Shop 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
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
Cited In (22)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- 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
- A comprehensive review and evaluation of permutation flowshop heuristics
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Iterative beam search algorithms for the permutation flowshop
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- An efficient local search for minimizing completion time variance in permutation flow shops
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)
