A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer-Verlag
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer-Verlag
Subjects
More information
Scope and Contents
Contents
In this paper, we tackle the problem of total flowtime and makespan minimisation in a permutation flowshop. For this, we introduce a multi-criteria iterated greedy search algorithm. This algorithm iterates over a multicriteria constructive heuristic approach to yield a set of Pareto-efficient solutions (a posteriori approach). The proposed algorith...
Alternative Titles
Full title
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_222372518
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_222372518
Other Identifiers
ISSN
0171-6468
E-ISSN
1436-6304
DOI
10.1007/s00291-007-0098-z
