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
Journal ArticleDOI
Two-machine flowshop scheduling to minimize total tardiness
Jason Chao-Hsien Pan,En-Tsu Fan +1 more
TL;DR: Five dominance properties for the precedence relations between jobs in an optimal solution are proposed and a sharp lower bound on the total tardiness of a subproblem is derived in the branch-and-bound algorithm to facilitate the search for an optimal schedule.
Journal ArticleDOI
An SA/TS mixture algorithm for the scheduling tardiness problem
TL;DR: A mixed application of simulated annealing (which allows TS to be started from a better initial solution) and tabu search is studied.
Journal ArticleDOI
Note on minimizing total tardiness in a two-machine flowshop
TL;DR: This note considers the problem of sequencing jobs to minimize total tardiness in a two-machine flowshop and shows how three dominance conditions and a lower bound previously developed for this problem can be improved.
Dissertation
Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems
TL;DR: In this article, the authors define the statistical methods that are appropriate for the analysis of stochastic local search (SLS) algorithms and compare them in a rigorous experimental analysis.
Journal ArticleDOI
Minimum tardiness scheduling in flow shops: Construction and evaluation of alternative solution approaches
TL;DR: The results of this study indicate the need to look beyond permutation schedules for solving the flow shop tardiness problem, and suggest that the criterion for determining machine criticality needs to take the scheduling objective into consideration.
Related Papers (5)
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Rubén Ruiz,Thomas Stützle +1 more