A new set of high-performing heuristics to minimise flowtime in permutation flowshops
From MaRDI portal
Publication:337260
DOI10.1016/j.cor.2014.08.004zbMath1348.90257OpenAlexW2085370067MaRDI QIDQ337260
Jose M. Framinan, Victor Fernandez-Viagas
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (14)
Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ The 2-stage assembly flowshop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time ⋮ 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 ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
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
- Some efficient heuristic methods for the flow shop 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
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- 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
This page was built for publication: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
