Journal ArticleDOI
Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem
Eva Vallada,Rubén Ruiz +1 more
TLDR
In this article, three genetic algorithms are presented for the permutation flow shop scheduling problem with total tardiness minimisation criterion, which includes advanced techniques like path relinking, local search and a procedure to control the diversity of the population.Abstract:
In this work three genetic algorithms are presented for the permutation flowshop scheduling problem with total tardiness minimisation criterion. The algorithms include advanced techniques like path relinking, local search and a procedure to control the diversity of the population. We also include a speed up procedure in order to reduce the computational effort needed for the local search technique, which results in large CPU time savings. A complete calibration of the different parameters and operators of the proposed algorithms by means of a design of experiments approach is also given. We carry out a comparative evaluation with the best methods that can be found in the literature for the total tardiness objective, and with adaptations of other state-of-the-art methods originally proposed for other objectives, mainly makespan. All the methods have been implemented with and without the speed up procedure in order to test its effect. The results show that the proposed algorithms are very effective, outperforming the remaining methods of the comparison by a considerable margin.read more
Citations
More filters
Journal ArticleDOI
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Jian Gao,Rong Chen,Wu Deng +2 more
TL;DR: In this paper, a new tabu algorithm was proposed to solve the distributed permutation flow shop scheduling problem, which exploits a novel tabu strategy to swap sub-sequences of jobs to generate neighborhood.
Journal ArticleDOI
An estimation of distribution algorithm for lot-streaming flow shop problems with setup times
Quan-Ke Pan,Rubén Ruiz +1 more
TL;DR: A novel estimation of distribution algorithm (EDA) is proposed with a job permutation based representation to solve an n-job m-machine lot-streaming flow shop scheduling problem with sequence-dependent setup times under both the idling and no-idling production cases.
Journal ArticleDOI
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation
TL;DR: This paper identifies and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established.
Journal ArticleDOI
The Distributed Assembly Permutation Flowshop Scheduling Problem
TL;DR: In this paper, a distributed assembly permutation flow shop scheduling problem (DAPFSP) with two stages is proposed to model and study complex supply chains, which is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP).
Book ChapterDOI
Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications
TL;DR: This work describes the hybridization of path-relinking with genetic algorithms to implement a progressive crossover operator, and describes the mechanics, implementation issues, randomization, and use of pools of high-quality solutions to hybridize path- Relinking with other heuristic methods.
References
More filters
Journal Article
The Design and Analysis of Experiments
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Book
Practical Nonparametric Statistics
TL;DR: Probability Theory. Statistical Inference. Contingency Tables. Appendix Tables. Answers to Odd-Numbered Exercises and Answers to Answers to Answer Questions as discussed by the authors.
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Journal ArticleDOI
The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance
TL;DR: The use of ranks to avoid the assumption of normality implicit in the analysis of variance has been studied in this article, where the use of rank to avoid normality is discussed.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more