The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898)
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 6036028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect |
scientific article; zbMATH DE number 6036028 |
Statements
The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (English)
0 references
18 May 2012
0 references
scheduling
0 references
deteriorating
0 references
aging effect
0 references
computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8608392477035522
0 references
0.853463351726532
0 references
0.8479685187339783
0 references
0.8321546912193298
0 references
0.8209011554718018
0 references
