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
Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs.
TL;DR: In this paper, a mathematical model has been formulated to minimize makespan (C max). Afterwards, genetic and tabu search algorithms have been developed, and some methods have been applied to genetic algorithm in order to maintain population diversity.
Journal ArticleDOI
Matheuristic algorithms for minimizing total tardiness in the m-machine flow-shop scheduling problem
TL;DR: This paper considers the m-machine permutation flow-shop problem with total tardiness minimization and proposes several matheuristic algorithms, which are an hybridization of a local search and an exact resolution method.
Journal ArticleDOI
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
TL;DR: Several properties of the problem are defined in order to be able to partly apply Taillard's acceleration and are incorporated in two proposed algorithms: a bounded-insertion-based constructive heuristic and an advanced non-population-based algorithm.
Journal ArticleDOI
Two-stage assembly scheduling problem for minimizing total tardiness with setup times
TL;DR: This study investigates the two-stage assembly flowshop scheduling problem with separate setup times as well as proposing much better algorithms for the zero setup time case, and develops a dominance relation and utilizes the dominance relation in the proposed algorithms.
Journal ArticleDOI
Effective heuristics and metaheuristics to minimise total tardiness for the distributed permutation flowshop scheduling problem
Ankit Khare,Sunil Agrawal +1 more
TL;DR: This paper presents a mixed-integer linear programming model, two heuristics, hybrid discrete Harris hawks optimisation and an enhanced variant of iterated greedy algorithm to solve the distributed permutation flowshop scheduling problem (DPFSP).
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