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 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.
Journal ArticleDOI
A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems
TL;DR: In this paper, a new discrete firefly meta-heuristic was proposed to minimize the makespan for the permutation flow shop scheduling problem, and the results of implementation of the proposed method are compared with other existing ant colony optimization technique.
Journal ArticleDOI
A scatter search algorithm for the distributed permutation flowshop scheduling problem
Bahman Naderi,Rubén Ruiz +1 more
TL;DR: This paper presents a scatter search (SS) method for this problem to optimize makespan and shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin.
Journal ArticleDOI
Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
TL;DR: A brief literature review of the contributions to MOFSP is provided and areas of opportunity for future research are identified.
Journal ArticleDOI
Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
TL;DR: A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out and the results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.
References
More filters
Genetic Algorithms, Path Relinking, the Flowshop Sequencing Problem and
Colin R. Reeves,Takeshi Yamada +1 more
TL;DR: In this article, a simple GA was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem (PFSP), which was comparable to that of a naive neighborhood search technique and a proven simulated annealing algorithm.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more