An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor...
An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
About this item
Publication information
Publisher
London: Taylor & Francis
Subjects
More information
Scope and Contents
Contents
This paper proposes a simple iterated greedy (IG) heuristic to minimize makespan in a multistage hybrid flowshop with multiprocessor tasks. To validate and verify the proposed heuristic, computational experiments have been conducted on two well-known benchmark problem sets. The experiment results clearly reveal that the proposed IG heuristic is hig...
Alternative Titles
Full title
An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_231386649
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_231386649
Other Identifiers
ISSN
0160-5682
E-ISSN
1476-9360
DOI
10.1057/palgrave.jors.2602625
