Complexity of scheduling with proportional deterioration and release dates (Q1787790)
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: Complexity of scheduling with proportional deterioration and release dates |
scientific article; zbMATH DE number 6947980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of scheduling with proportional deterioration and release dates |
scientific article; zbMATH DE number 6947980 |
Statements
Complexity of scheduling with proportional deterioration and release dates (English)
0 references
5 October 2018
0 references
scheduling
0 references
computational complexity
0 references
deteriorating jobs
0 references
NP-hardness
0 references
0 references
0 references
0 references
0.8740642666816711
0 references
0.8605198860168457
0 references
0.8599802255630493
0 references
0.858970582485199
0 references
0.8588734865188599
0 references
