An efficient constructive heuristic for flowtime minimisation in permutation flow shops
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
About this item
Full title
Author / Creator
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, we propose a heuristic for mean/total flowtime minimisation in permutation flow shops. The heuristic exploits the idea of ‘optimising’ partial schedules, already present in the NEH-heuristic (Omega 11 (1983) 91) with respect to makespan minimisation. We compare the proposed heuristic against the ones by Rajendran and Ziegler (Eur. J....
Alternative Titles
Full title
An efficient constructive heuristic for flowtime minimisation in permutation flow shops
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_236495524
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_236495524
Other Identifiers
ISSN
0305-0483
E-ISSN
1873-5274
DOI
10.1016/S0305-0483(03)00047-1
