Review and classification of constructive heuristics mechanisms for no-wait flow shop problem
Review and classification of constructive heuristics mechanisms for no-wait flow shop problem
About this item
Full title
Author / Creator
Publisher
London: Springer London
Journal title
Language
English
Formats
Publication information
Publisher
London: Springer London
Subjects
More information
Scope and Contents
Contents
Permutation flow shop scheduling has been studied since the 1950s. Due to practical applications and because of its complex nature, several constrains have been studied, for example the no-wait flow shop problem. Classified as non-deterministic polynomial-time hard (NP-hard), several constructive heuristics have been proposed to reach the best trad...
Alternative Titles
Full title
Review and classification of constructive heuristics mechanisms for no-wait flow shop problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2262268163
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2262268163
Other Identifiers
ISSN
0268-3768
E-ISSN
1433-3015
DOI
10.1007/s00170-015-8209-5
