scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem

01 Feb 2010-Omega-international Journal of Management Science (OMEGA (INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE))-Vol. 38, Iss: 12, pp 57-67
TL;DR: 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.

Content maybe subject to copyright    Report

Citations
More filters
Journal Article
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.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. 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. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

13,333 citations

Journal ArticleDOI
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.
Abstract: Article history: Received 23 January 2010 Received in revised form 23 April 2010 Accepted 26 April 2010 Available online 26 April 2010 During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and metaheuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems. © 2010 Growing Science Ltd. All rights reserved.

248 citations

Journal ArticleDOI
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.

211 citations


Cites methods from "Genetic algorithms with path relink..."

  • ...Inspired by the generational schemes of Ruiz et al. (2006) and Vallada and Ruiz (2010), pn is included into H if and only if: 1) The makespan of pn is better than the makespan of the worst solution in set H and 2) It is unique, i.e., there are no other identical solutions in set H....

    [...]

Journal ArticleDOI
TL;DR: A brief literature review of the contributions to MOFSP is provided and areas of opportunity for future research are identified.
Abstract: The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain performance measure(s). The job can be processed on at most one machine; meanwhile one machine can process at most one job. The most common objective for this problem is makespan. However, many real-world scheduling problems are multi-objective by nature. Over the years there have been several approaches used to deal with the multi-objective flow shop scheduling problems (MOFSP). Hence, in this study, we provide a brief literature review of the contributions to MOFSP and identify areas of opportunity for future research.

191 citations

Journal ArticleDOI
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.
Abstract: Distributed permutation flowshop scheduling problem (DPFSP) has become a very active research area in recent years. However, minimizing total flowtime in DPFSP, a very relevant and meaningful objective for today's dynamic manufacturing environment, has not captured much attention so far. In this paper, we address the DPFSP with total flowtime criterion. To suit the needs of different CPU time demands and solution quality, we present three constructive heuristics and four metaheuristics. The constructive heuristics are based on the well-known LR and NEH heuristics. The metaheuristics are based on the high-performing frameworks of discrete artificial bee colony, scatter search, iterated local search, and iterated greedy, which have been applied with great success to closely related scheduling problems. We explore the problem-specific knowledge and accelerations to evaluate neighboring solutions for the considered problem. We introduce advanced and effective technologies like a referenced local search, a strategy to escape from local optima, and an enhanced intensive search method for the presented metaheuristics. A comprehensive computational campaign against the closely related and well performing algorithms in the literature is carried out. The results show that both the presented constructive heuristics and metaheuristics are very effective for solving the DPFSP with total flowtime criterion.

179 citations

References
More filters
Journal Article
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.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. 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. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

13,333 citations


"Genetic algorithms with path relink..." refers methods in this paper

  • ...First, we check the three main hypotheses of ANOVA: normality, homocedasticity and independence of the residuals (Montgomery, 2000)....

    [...]

Book
01 Jan 1971
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.
Abstract: Probability Theory. Statistical Inference. Some Tests Based on the Binomial Distribution. Contingency Tables. Some Methods Based on Ranks. Statistics of the Kolmogorov-Smirnov Type. References. Appendix Tables. Answers to Odd-Numbered Exercises. Index.

10,382 citations

Book
31 Jul 1997
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.
Abstract: From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof 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 conservationand scores of other problems. The major ideas of tabu search arepresented with examples that show their relevance to multipleapplications. Numerous illustrations and diagrams are used to clarifyprinciples that deserve emphasis, and that have not always been wellunderstood or applied. The book's goal is to provide ''hands-on' knowledge and insight alike, rather than to focus exclusively eitheron computational recipes or on abstract themes. This book is designedto be useful and accessible to researchers and practitioners inmanagement science, industrial engineering, economics, and computerscience. It can appropriately be used as a textbook in a masterscourse or in a doctoral seminar. Because of its emphasis on presentingideas through illustrations and diagrams, and on identifyingassociated practical applications, it can also be used as asupplementary text in upper division undergraduate courses. Finally, there are many more applications of tabu search than canpossibly be covered in a single book, and new ones are emerging everyday. The book's goal is to provide a grounding in the essential ideasof tabu search that will allow readers to create successfulapplications of their own. Along with the essentialideas,understanding of advanced issues is provided, enabling researchers togo beyond today's developments and create the methods of tomorrow.

6,373 citations

Book
15 Jul 1994
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.
Abstract: This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems. The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments. Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University.

6,209 citations


"Genetic algorithms with path relink..." refers background in this paper

  • ...According to Pinedo (2008) this problem is denoted as F/prmu/Cmax and the associated decision problem was shown to be NP-complete by Rinnooy Kan (1976) for m ≥ 3....

    [...]

  • ...Therefore, the PFSP with this criterion is denoted as F/prmu/ ∑ Tj (Pinedo, 2008) where Tj = max{Cj − dj, 0} is the tardiness of job j, being dj its due date and Cj its completion time at the last machine of the shop....

    [...]

Journal ArticleDOI
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.
Abstract: (1937). The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance. Journal of the American Statistical Association: Vol. 32, No. 200, pp. 675-701.

4,751 citations


"Genetic algorithms with path relink..." refers methods in this paper

  • ...Path relinking is a search technique originally proposed by Glover and Laguna (1997) where the objective is to explore the search space or path between a given set (usually two) of good solutions....

    [...]

  • ...More speci cally, we apply the Friedman test (Friedman, 1937) according to Conover (1999) to compute the Minimal Signi cant Di erence (MSD) between the rank means of any two algorithms....

    [...]