Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Genetic local search for multi-objective flowshop scheduling problems
Author: Arroyo, JEC
Armentano, VA
Abstract: This paper addresses flowshop scheduling problems with multiple performance criteria in such a way as to provide the decision maker with approximate Pareto optimal solutions. Genetic algorithms have attracted the attention of researchers in the nineties as a promising technique for solving multi-objective combinatorial optimization problems. We propose a genetic local search algorithm with features such as preservation of dispersion in the population, elitism, and use of a parallel multi-objective local search so as intensify the search in distinct regions. The concept of Pareto dominance is used to assign fitness to the solutions and in the local search procedure. The algorithm is applied to the flowshop scheduling problem for the following two pairs of objectives: (i) makespan and maximum tardiness; (ii) makespan and total tardiness. For instances involving two machines, the algorithm is compared with Branchand-Bound algorithms proposed in the literature. For such instances and larger ones, involving up to 80 jobs and 20 machines, the performance of the algorithm is compared with two multi-objective genetic local search algorithms proposed in the literature. Computational results show that the proposed algorithm yields a reasonable approximation of the Pareto optimal set. (C) 2004 Elsevier B.V. All rights reserved.
Subject: multi-objective combinatorial optimization
genetic local search
flowshop scheduling
Country: Holanda
Editor: Elsevier Science Bv
Citation: European Journal Of Operational Research. Elsevier Science Bv, v. 167, n. 3, n. 717, n. 738, 2005.
Rights: fechado
Identifier DOI: 10.1016/j.ejor.2004.07.017
Date Issue: 2005
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000231298300008.pdf493.02 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.