NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (Q859949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time |
scientific article; zbMATH DE number 5117720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time |
scientific article; zbMATH DE number 5117720 |
Statements
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time (English)
0 references
22 January 2007
0 references
scheduling
0 references
single-variable-resource
0 references
total weighted completion time
0 references
NP-hardness
0 references
0.98204666
0 references
0.89781576
0 references
0.89716125
0 references
0.88925505
0 references
0.88091534
0 references
0.8795302
0 references
0.8780714
0 references
