Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
About this item
Full title
Author / Creator
Publisher
London: Routledge
Journal title
Language
English
Formats
Publication information
Publisher
London: Routledge
Subjects
More information
Scope and Contents
Contents
The distributed permutation flowshop scheduling problem (DPFSP) is a newly proposed topic in the shop scheduling field, which has important application in globalised and multi-plant environments. This study presents a modified iterated greedy (MIG) algorithm for this problem to minimise the maximum completion time among all the factories. Compared...
Alternative Titles
Full title
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1426367353
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1426367353
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2013.790571
