Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A memetic algorithm for the total tardiness single machine scheduling problem
Author: Franca, PM
Mendes, A
Moscato, P
Abstract: In this paper, a new memetic algorithm (MA) for the total tardiness single machine scheduling (SMS) problem with due dates and sequence-dependent setup times is proposed. The main contributions with respect to the implementation of the hybrid population approach are a hierarchically structured population conceived as a ternary tree and the evaluation of three recombination operators. Concerning the local improvement procedure, several neighborhood reduction schemes are developed and proved to be effective when compared to the complete neighborhood. Results of computational experiments are reported for a set of randomly generated test problems, The memetic approach and a pure genetic algorithm (GA) version are compared with a multiple start algorithm that employs the all-pairs neighborhood as well as two constructive heuristics. (C) 2001 Elsevier Science B.V. All rights reserved.
Subject: scheduling
memetic algorithms
hybrid genetic algorithms
single machine scheduling
sequence-dependent setup times
Country: Holanda
Editor: Elsevier Science Bv
Citation: European Journal Of Operational Research. Elsevier Science Bv, v. 132, n. 1, n. 224, n. 242, 2001.
Rights: fechado
Identifier DOI: 10.1016/S0377-2217(00)00140-5
Date Issue: 2001
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000168572900019.pdf248.99 kBAdobe PDFView/Open

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