Strong NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q3014548)
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 5926314
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time |
scientific article; zbMATH DE number 5926314 |
Statements
19 July 2011
0 references
scheduling
0 references
resource requirement
0 references
total weighted completion time
0 references
strong NP-hardness
0 references
0.97295081615448
0 references
0.8347043395042419
0 references
0.8338363766670227
0 references
0.8266194462776184
0 references
