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
Solving bi-objective flow shop problem with hybrid path relinking algorithm
TL;DR: Different ways to integrate path relinking techniques into the hypervolume-based multi-objective local search algorithm (HBMOLS) are investigated and light is shed on ways to further improvements.
Journal ArticleDOI
Exterior Path Relinking for Zero-One Optimization
TL;DR: The beyond-form of path relinking is discussed, which is called Exterior Path Relinking, and its relevance for diversification strategies in binary optimization is focused on.
Journal ArticleDOI
Scheduling a permutation flow shop with family setups to minimise total tardiness
TL;DR: In this paper, the authors present several procedures for scheduling a permutation flow shop with family setups when the objective is to minimize total tardiness, and show that significant reductions in total Tardiness can be obtained if the time required to perform the family setups is reduced.
Proceedings ArticleDOI
A populated local search with differential evolution for blocking flowshop scheduling problem
TL;DR: This paper presents a populated local search algorithm through a differential evolution algorithm for solving the blocking flowshop scheduling problem under makespan criterion and presents the greedy randomized adaptive search procedure (GRASP) for the problem on hand.
Book ChapterDOI
Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
Eva Vallada,Rubén Ruiz +1 more
TL;DR: A genetic algorithm is proposed, which includes a procedure for inserting idle times in the production sequence in order to improve the objective value, and it is concluded that the proposed method shows a good performance.
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