Efficient composite heuristics for total flowtime minimization in permutation flow shops
Efficient composite heuristics for total flowtime minimization in permutation flow shops
About this item
Full title
Author / Creator
Li, Xiaoping , Wang, Qian and Wu, Cheng
Publisher
Exeter: Elsevier Ltd
Journal title
Language
English
Formats
Publication information
Publisher
Exeter: Elsevier Ltd
Subjects
More information
Scope and Contents
Contents
In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a schedule by inheriting temporal parameters from its parent i...
Alternative Titles
Full title
Efficient composite heuristics for total flowtime minimization in permutation flow shops
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_236521743
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_236521743
Other Identifiers
ISSN
0305-0483
E-ISSN
1873-5274
DOI
10.1016/j.omega.2006.11.003
