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
DOI10.1016/j.ejor.2016.09.055zbMath1394.90271OpenAlexW2530577942MaRDI QIDQ1752855
Jose M. Framinan, Rubén Ruiz, Victor Fernandez-Viagas
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/151044
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (39)
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 ⋮ An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem ⋮ 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 ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop 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 ⋮ A cutoff time strategy based on the coupon collector's 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 ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ An effective new heuristic algorithm for solving permutation flow shop scheduling problem ⋮ 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 ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Fast heuristics for minimizing the makespan in non-permutation flow shops ⋮ 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 ⋮ 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 best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- New hard benchmark for flowshop scheduling problems minimising makespan
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops
- Variability of completion time differences in permutation flow shop scheduling
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- A discrete inter-species cuckoo search for flowshop scheduling problems
- MHD effects on the instability of thermocapillary convection in two-layer fluid system
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
- Scheduling flow shops using differential evolution algorithm
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Some efficient heuristic methods for the flow shop sequencing problem
- An improved NEH-based heuristic for the permutation flowshop problem
- A proposal for a hybrid meta-strategy for combinatorial optimization problems
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- A fast tabu search algorithm for the permutation flow-shop problem
- Benchmarks for shop scheduling problems
- A genetic algorithm for flowshop sequencing
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- An ant colony system for permutation flow-shop sequencing
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- Heuristic methods and applications: A categorized survey
- A neuro-tabu search heuristic for the flow shop scheduling problem
- Benchmarks for basic scheduling problems
- A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
- Some aspects of scatter search in the flow-shop problem
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
- Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance
- 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
- Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
- A local search method for permutation flow shop scheduling
- An improved genetic algorithm for the flowshop scheduling problem
- Ordonnancements à contraintes disjonctives
- A high quality solution constructive heuristic for flow shop sequencing
- A genetic algorithm for flow shop scheduling problems
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Flowshop-scheduling problems with makespan criterion: a review
- Scheduling
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
