An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling
An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling
About this item
Full title
Author / Creator
Publisher
London: Springer-Verlag
Journal title
Language
English
Formats
Publication information
Publisher
London: Springer-Verlag
Subjects
More information
Scope and Contents
Contents
The problem of permutation flowshop scheduling is considered with the objective of minimizing the total flowtime. We present a constructive heuristic and two composite heuristics to solve the problem. The composite heuristics combine the simulated annealing method of Chakravarthy and Rajendran [Production Planning and Control 10 (1999)], the constr...
Alternative Titles
Full title
An efficient heuristic approach to total flowtime minimization in permutation flowshop scheduling
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2262466199
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2262466199
Other Identifiers
ISSN
0268-3768
E-ISSN
1433-3015
DOI
10.1007/s00170-007-1156-z
