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
Estimation of distribution algorithm with path relinking for the blocking flow-shop scheduling problem
TL;DR: In this paper, the authors presented an effective estimation of distribution algorithm, named P-EDA, to solve the blocking flow-shop scheduling problem (BFSP) with the makespan criterion.
Journal ArticleDOI
An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop
TL;DR: In this article, the minimal earliness tardiness -machine permutation flow shop scheduling problem with distinct due dates and no inserted idle time when a job is waiting is considered.
Journal ArticleDOI
Flow shop scheduling with a batch processor and limited buffer
TL;DR: Numerical results demonstrate that the proposed algorithms are capable of providing high-quality solutions for large-scale problems within a reasonable computational time.
Journal ArticleDOI
A new methodology for the open-pit mine production scheduling problem
TL;DR: This paper proposes a new method to quickly generate near optimum feasible (integer) solutions by using the fractional solutions from the linear programming (LP) relaxation of the IP model and shows better performance than the heuristic used to tackle the same deposits in the literature.
Journal ArticleDOI
Minimizing total tardiness in no-wait flowshops
Tariq Aldowaisan,Ali Allahverdi +1 more
TL;DR: This work considers a number of dispatching rules commonly used for the considered objective in other scheduling environments and proposes simulated annealing and genetic algorithms by using the best performing dispatching rule as an initial solution; and concludes that the enhanced SA outperforms the enhanced GA.
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