Exact method for the two-machine flow-shop problem with time delays
Exact method for the two-machine flow-shop problem with time delays
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
We address the two-machine flow-shop scheduling problem with time delays in order to minimize the makespan, i.e., the maximum completion time. We present a comprehensive theoretical analysis of the different lower bounds of the state of the art and we elucidate dominance relationships between them. We then introduce an exact method based on a branc...
Alternative Titles
Full title
Exact method for the two-machine flow-shop problem with time delays
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_01897163v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_01897163v1
Other Identifiers
ISSN
0254-5330
E-ISSN
1572-9338
DOI
10.1007/s10479-018-3082-x
