Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm
Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm
About this item
Full title
Author / Creator
Publisher
London: Taylor & Francis
Journal title
Language
English
Formats
Publication information
Publisher
London: Taylor & Francis
Subjects
More information
Scope and Contents
Contents
The multi-objective reentrant hybrid flowshop scheduling problem (RHFSP) exhibits significance in many industrial applications, but appears under-studied in the literature. In this study, an iterated Pareto greedy (IPG) algorithm is proposed to solve a RHFSP with the bi-objective of minimising makespan and total tardiness. The performance of the pr...
Alternative Titles
Full title
Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1669897116
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1669897116
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2014.910627
