A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
From MaRDI portal
Publication:1752855
Recommendations
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A computational study of the permutation flow shop problem based on a tight lower bound
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- On some lower bounds for the permutation flowshop problem
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics
- A discrete inter-species cuckoo search for flowshop scheduling problems
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A fast tabu search algorithm for the permutation flow-shop problem
- A genetic algorithm for flow shop scheduling problems
- A genetic algorithm for flowshop sequencing
- A high quality solution constructive heuristic for flow shop sequencing
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
- A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
- A local search method for permutation flow shop scheduling
- A neuro-tabu search heuristic for the flow shop scheduling problem
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- An ant colony system for permutation flow-shop sequencing
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- An improved genetic algorithm for the flowshop scheduling problem
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- Benchmarks for basic scheduling problems
- Benchmarks for shop scheduling problems
- Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
- Flowshop-scheduling problems with makespan criterion: a review
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
- Heuristic methods and applications: A categorized survey
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- MHD effects on the instability of thermocapillary convection in two-layer fluid system
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- Ordonnancements à contraintes disjonctives
- Scheduling flow shops using differential evolution algorithm
- Scheduling. Theory, algorithms, and systems.
- Some aspects of scatter search in the flow-shop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- Variability of completion time differences in permutation flow shop scheduling
Cited in
(60)- Solving the continuous flow-shop scheduling problem by metaheuristics.
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Revisiting simulated annealing: a component-based analysis
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Parallel hybrid heuristics for the permutation flow shop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem
- A variable block insertion heuristic for the energy-efficient permutation flowshop scheduling with makespan criterion
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
- New efficient heuristics for scheduling open shops with makespan minimization
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- A landscape-based analysis of fixed temperature and simulated annealing
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- A cutoff time strategy based on the coupon collector's problem
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
- The evolution of schematic representations of flow shop scheduling problems
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- New hard benchmark for flowshop scheduling problems minimising makespan
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Exactly solving hard permutation flowshop scheduling problems on peta-scale GPU-accelerated supercomputers
- An efficient algorithm for lot permutation flow shop scheduling problem
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- On some lower bounds for the permutation flowshop problem
- Shop scheduling in manufacturing environments: a review
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems
- 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
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach
- Flowshop with additional resources during setups: mathematical models and a GRASP algorithm
- A systematic literature review on no-idle flow shop scheduling problem
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- The distributed no-idle permutation flowshop scheduling problem with due windows
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Deterministic constructive N-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Mip-based local search for permutation flowshop scheduling with makespan objective
- Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
- A systematic review of permutation flow shop scheduling with due-date-related objectives
- Bounds for the permutation flowshop scheduling problem: new framework and theoretical insights
- An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem
This page was built for publication: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752855)
