scispace - formally typeset
Search or ask a question
Author

Gerardo Minella

Bio: Gerardo Minella is an academic researcher from Polytechnic University of Valencia. The author has contributed to research in topics: Job shop scheduling & Metaheuristic. The author has an hindex of 4, co-authored 4 publications receiving 436 citations.

Papers
More filters
Journal ArticleDOI
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

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

154 citations

Journal ArticleDOI
TL;DR: This work proposes a simple, yet powerful algorithm for the sequence dependent setup times flowshop problem with several criteria, referred to as Restarted Iterated Pareto Greedy or RIPG and is compared against the best performing approaches from the relevant literature.

90 citations

Journal ArticleDOI
TL;DR: The proposed multi-objective Iterated Greedy method is shown to outperform other recent approaches in comprehensive computational and statistical tests that comprise a large number of instances with objectives involving makespan, tardiness and flowtime.

88 citations


Cited by
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: A literature review on exact, heuristic and metaheuristic methods that have been proposed for the solution of the hybrid flow shop problem is presented.

647 citations

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

Journal ArticleDOI
TL;DR: This paper develops a chromosome that can describe a feasible schedule such that meta-heuristics can be applied and innovatively adopts an improved nondominated sorting genetic algorithm to solve the optimization problem for the first time.
Abstract: With the interaction of discrete-event and continuous processes, it is challenging to schedule crude oil operations in a refinery. This paper studies the optimization problem of finding a detailed schedule to realize a given refining schedule. This is a multiobjective optimization problem with a combinatorial nature. Since the original problem cannot be directly solved by using heuristics and meta-heuristics, the problem is transformed into an assignment problem of charging tanks and distillers. Based on such a transformation, by analyzing the properties of the problem, this paper develops a chromosome that can describe a feasible schedule such that meta-heuristics can be applied. Then, it innovatively adopts an improved nondominated sorting genetic algorithm to solve the problem for the first time. An industrial case study is used to test the proposed solution method. The results show that the method makes a significant performance improvement and is applicable to real-life refinery scheduling problems.

229 citations

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