Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A partial enumeration heuristic for multi-objective flowshop scheduling problems
Author: Arroyo, JEC
Armentano, VA
Abstract: This paper addresses the flowshop scheduling problem with multiple performance objectives in such a way as to provide the decision maker with approximate Pareto optimal solutions. It is well known that the partial enumeration constructive heuristic NEH and its adaptations perform well for single objectives such as makespan, total tardiness and flowtime. In this paper, we develop a similar heuristic using the concept of Pareto dominance when comparing partial and complete schedules. The heuristic is tested on problems involving combinations of the above criteria. For the two-machine case, and the pairs of objectives: (i) makespan and maximum tardiness, (ii) makespan and total tardiness, the heuristic is compared with branch-and-bound algorithms proposed in the literature. For two and more than two machines, and the criteria combinations considered in this article, the heuristic performance is tested against constructive heuristics reported in the literature. By means of an illustrative example, it is shown that a genetic algorithm from the literature performs better when starting from heuristic solutions rather than random solutions.
Subject: flowshop scheduling
multi-objective optimization
combinatorial optimization
Country: Inglaterra
Editor: Palgrave Publishers Ltd
Rights: fechado
Identifier DOI: 10.1057/palgrave.jors.2601746
Date Issue: 2004
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
File Description SizeFormat 
WOS000223251400007.pdf1.44 MBAdobe PDFView/Open

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