A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
type: Item
instance of: scholarly article
title: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
zbMATH Open document ID: 1394.90271
author: Victor Fernandez-Viagas
author: Rubén Ruiz
author: Jose M. Framinan
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
full work available at URL: http://hdl.handle.net/10251/151044
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6872961
zbMATH Keywords: scheduling
zbMATH Keywords: flowshop
zbMATH Keywords: heuristics
zbMATH Keywords: metaheuristics
zbMATH Keywords: computational evaluation
MaRDI profile type: Publication
OpenAlex ID: W2530577942
cites work: Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach
cites work: Ordonnancements à contraintes disjonctives
cites work: Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
cites work: Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems
cites work: A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems
cites work: A self-guided genetic algorithm for permutation flowshop scheduling problems
cites work: A discrete inter-species cuckoo search for flowshop scheduling problems
cites work: Benchmarks for shop scheduling problems
cites work: An improved NEH-based heuristic for the permutation flowshop problem
cites work: A genetic algorithm for flow shop scheduling problems
cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: A proposal for a hybrid meta-strategy for combinatorial optimization problems
cites work: A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling
cites work: Some Numerical Experiments for an M × J Flow Shop and its Decision-Theoretical Aspects
cites work: A local search method for permutation flow shop scheduling
cites work: An improved NEH heuristic to minimize makespan in permutation flow shops
cites work: An empirical analysis of the optimality rate of flow shop heuristics
cites work: Variability of completion time differences in permutation flow shop scheduling
cites work: A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
cites work: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
cites work: A discrete version of particle swarm optimization for flowshop scheduling problems
cites work: An effective differential evolution algorithm for permutation flow shop scheduling problem
cites work: A high quality solution constructive heuristic for flow shop sequencing
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: Some aspects of scatter search in the flow-shop problem
cites work: Scheduling flow shops using differential evolution algorithm
cites work: Scheduling
cites work: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
cites work: An improved genetic algorithm for the flowshop scheduling problem
cites work: A genetic algorithm for flowshop sequencing
cites work: Flowshop-scheduling problems with makespan criterion: a review
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A neuro-tabu search heuristic for the flow shop scheduling problem
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: Benchmarks for basic scheduling problems
cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
cites work: A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
cites work: New hard benchmark for flowshop scheduling problems minimising makespan
cites work: Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance
cites work: An ant colony system for permutation flow-shop sequencing
cites work: Heuristic methods and applications: A categorized survey
cites work: An improved particle swarm optimization algorithm for flowshop scheduling problem
cites work: MHD effects on the instability of thermocapillary convection in two-layer fluid system
cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
DOI: 10.1016/J.EJOR.2016.09.055
Recommended article: A new set of high-performing heuristics to minimise flowtime in permutation flowshops
Recommended article: A computational study of the permutation flow shop problem based on a tight lower bound
Recommended article: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
Recommended article: A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
Recommended article: A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
Recommended article: Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Recommended article: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Recommended article: A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
Recommended article: Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Recommended article: On some lower bounds for the permutation flowshop problem