Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop schedulin...
Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems
About this item
Full title
Author / Creator
Publisher
Abingdon: Taylor & Francis Group
Journal title
Language
English
Formats
Publication information
Publisher
Abingdon: Taylor & Francis Group
Subjects
More information
Scope and Contents
Contents
Researchers have indicated that a permutation schedule can be improved by a non-permutation schedule in a flowshop with completion time-based criteria, such as makespan and total completion time. This study proposes a hybrid approach which draws on the advantages of simulated annealing and tabu search for the non-permutation flowshop scheduling pro...
Alternative Titles
Full title
Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_36135811
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_36135811
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207540701484939
