The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard |
scientific article |
Statements
The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (English)
0 references
10 February 2020
0 references
scheduling
0 references
learning effect
0 references
aging effect
0 references
computational complexity
0 references
strongly NP-hard
0 references
parallel branch and bound
0 references
0 references
0 references
0 references