Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
Date
Availability
1-1 of 1
Carlos Cotta
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: Journals Gateway
Evolutionary Computation (1998) 6 (1): 25–44.
Published: 01 March 1998
Abstract
View article
PDF
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to makespan optimization. Classical recombination operators are studied and empirically evaluated in this context. It is shown that the best operators work on representations in which absolute positions of tasks are relevant. Subsequently, some new operators operating on these representations are proposed. These new operators are designed to exhibit specific properties regarding implicit mutation and forma transmission. Their performance is shown to be competitive with traditional operators.