Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusio...
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion
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
In this paper, we are interested in minimizing the maximal or total cost of jobs in a permutation flowshop. This problem is known to be strongly NP-hard and exact algorithms of practical interest to solve it have very high, often factorial, worst-case complexity bounds. From a more theoretical point of view, we describe an Inclusion–Exclusion-based...
Alternative Titles
Full title
Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_03846937v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_03846937v1
Other Identifiers
ISSN
1094-6136
E-ISSN
1099-1425
DOI
10.1007/s10951-022-00759-1
