Minimising total tardiness in the m -machine flowshop problem: A review and evaluation of heuristics and metaheuristics
TL;DR: A review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented and the results allow us to clearly identify the state-of-the-art methods.
About: This article is published in Computers & Operations Research.The article was published on 2008-04-01. It has received 154 citations till now. The article focuses on the topics: Heuristics & Metaheuristic.
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
TL;DR: The DPFSP is characterized and six different alternative mixed integer linear programming (MILP) models that are carefully and statistically analyzed for performance are proposed.
353 citations
Cites background from "Minimising total tardiness in the m..."
...Vallada, Ruiz and Minella (2008) review 40 heuristics and metaheuristics for tardiness-related criteria....
[...]
TL;DR: A metaheuristic based on simulated annealing which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of the proposed SA is applied.
Abstract: In this communication, we strive to apply a novel simulated annealing to consider scheduling hybrid flowshop problems to minimize both total completion time and total tardiness. To narrow the gap between the theory and the practice of the hybrid flowshop scheduling, we integrate two realistic and practical assumptions which are sequence-dependent setup and transportation times into our problem. We apply a metaheuristic based on simulated annealing (SA) which strikes a compromise between intensification and diversification mechanisms to augment the competitive performance of our proposed SA. A comprehensive calibration of different parameters and operators are done. We employ Taguchi method to select the optimum parameters with the least possible number of experiments. For the purpose of performance evaluation of our proposed algorithm, we generate a benchmark against which the adaptations of high performing algorithms in the literature are brought into comparison. Moreover, we investigate the impacts of increase of number of jobs on the performance of our algorithm. The efficiency and effectiveness of our hybrid simulated annealing are inferred from all the computational results obtained in various situations.
177 citations
TL;DR: This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area, and identifies the best-performing methods from the literature.
Abstract: This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting, and Pareto approaches have been reviewed. Exact, heuristic, and metaheuristic methods have been surveyed. Furthermore, a complete computational evaluation is also carried out. A total of 23 different algorithms including both flowshop-specific methods as well as general multiobjective optimization approaches have been tested under three different two-criteria combinations with a comprehensive benchmark. All methods have been studied under recent state-of-the-art quality measures. Parametric and nonparametric statistical testing is profusely employed to support the observed performance of the compared methods. As a result, we have identified the best-performing methods from the literature, which along with the review, constitutes a reference work for further research.
172 citations
Cites background from "Minimising total tardiness in the m..."
...A recent review for the total tardiness version of the PFSP (the F/prmu/ ∑ Tj problem) can be found in Vallada et al. (2007)....
[...]
...Tj problem) can be found in Vallada et al. (2007). Single and multi-objective scheduling problems have been studied extensively....
[...]
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.
160 citations
Cites background or methods from "Minimising total tardiness in the m..."
...This simulated annealing shows the best performance for this problem up to the moment according to the results of Vallada et al. (2008)....
[...]
...Regarding the existing methods proposed for the total tardiness objective, from the comparative evaluation by Vallada et al. (2008) we have chosen the best two performing methods: the simulated annealing algorithms by Parthasarathy and Rajendran (1997b) and Hasija and Rajendran (2004), which are…...
[...]
...This is an interesting result since these two simulated annealing algorithms have been recently shown to outperform all other existing methods for the same criterion (Vallada et al., 2008)....
[...]
...These instances are generated following the procedure explained in Vallada et al. (2008) which is brie y summarised as follows: Two instances for each combination of n and m are generated where n = {50, 150, 250, 350} and m = {10, 30, 50}....
[...]
...Vallada et al. (2008) provided an extensive literature review along with a comparative evaluation about the PFSP with the objective of total tardiness minimisation....
[...]
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
"Minimising total tardiness in the m..." refers methods in this paper
...We carried out an analysis of variance (ANOVA) [42] of heuristic methods, where we have 23 different heuristics and 12,420 treatments in total....
[...]
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•
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
"Minimising total tardiness in the m..." refers background in this paper
...The simplification of considering only permutation schedules (the processing order of the jobs is the same for all machines) is very common and the resulting problem is called the permutation flowshop problem (PFSP) and denoted as F/prmu/Cmax [1]....
[...]
...This problem is denoted as F/prmu/ ∑ Tj [1] and it is known to beNP-hard in the ordinary sense even when there is only one machine and NP-hard in the strong sense for m 2....
[...]
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
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Abstract: In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2,255 citations