Two new robust genetic algorithms for the flowshop scheduling problem
Two new robust genetic algorithms for the flowshop scheduling problem
About this item
Full title
Author / Creator
Publisher
Exeter: Elsevier Ltd
Journal title
Language
English
Formats
Publication information
Publisher
Exeter: Elsevier Ltd
Subjects
More information
Scope and Contents
Contents
The flowshop scheduling problem (FSP) has been widely studied in the literature and many techniques for its solution have been proposed. Some authors have concluded that genetic algorithms are not suitable for this hard, combinatorial problem unless hybridization is used. This work proposes new genetic algorithms for solving the permutation FSP tha...
Alternative Titles
Full title
Two new robust genetic algorithms for the flowshop scheduling problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_236399495
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_236399495
Other Identifiers
ISSN
0305-0483
E-ISSN
1873-5274
DOI
10.1016/j.omega.2004.12.006
