The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7165682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard |
scientific article; zbMATH DE number 7165682 |
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
0.8791400790214539
0 references
0.8554487228393555
0 references
0.853463351726532
0 references
0.8488773107528687
0 references
0.8421477675437927
0 references
