Comparison of heuristics for flowtime minimisation in permutation flowshops
From MaRDI portal
Publication:2485174
Recommendations
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- A comprehensive review and evaluation of permutation flowshop heuristics
Cites work
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- An Evaluation of Flow Shop Sequencing Heuristics
- Benchmarks for basic scheduling problems
- 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
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Flowshop sequencing with mean flowtime objective
- Heuristic approaches for n/m/F/ C_i scheduling problems
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some efficient heuristic methods for the flow shop sequencing problem
Cited in
(38)- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Flowshop sequencing with mean flowtime objective
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- 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
- A comprehensive review and evaluation of permutation flowshop heuristics
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- On heuristic solutions for the stochastic flowshop scheduling problem
- Flowshop scheduling with a general exponential learning effect
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A generalized constructive algorithm using insertion-based heuristics
- 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
- Reducing mean flow time in permutation flow shop
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- scientific article; zbMATH DE number 2079888 (Why is no real title available?)
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- Mip-based local search for permutation flowshop scheduling with makespan objective
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A bicriteria flowshop scheduling with a learning effect
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
This page was built for publication: Comparison of heuristics for flowtime minimisation in permutation flowshops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485174)
