A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
From MaRDI portal
Publication:339553
DOI10.1016/j.cor.2012.05.018zbMath1349.90386OpenAlexW1988227855MaRDI QIDQ339553
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/40392
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
New hard benchmark for flowshop scheduling problems minimising makespan ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ A new set of high-performing heuristics to minimise flowtime in permutation flowshops ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ A discrete inter-species cuckoo search for flowshop scheduling problems ⋮ Reduction of permutation flowshop problems to single machine problems using machine dominance relations ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ 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 ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- Unnamed Item
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- 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 iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- Flowshop sequencing with mean flowtime objective
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Variable neighborhood search
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Flowshop scheduling research after five decades
- Optimal two- and three-stage production schedules with setup times included
- ANALYSIS FOR MINIMIZING WEIGHTED MEAN FLOW-TIME IN FLOW-SHOP SCHEDULING
- A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
- Flowshop and Jobshop Schedules: Complexity and Approximation
- AN ADJACENT PAIRWISE APPROACH TO THE MEAN FLOW-TIME SCHEDULING PROBLEM
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- No-wait flowshops with bicriteria of makespan and total completion time
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Design and Analysis of Experiments, Second Edition
- Flowshop-scheduling problems with makespan criterion: a review
- A fast method for heuristics in large-scale flow shop scheduling
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Scheduling
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
