The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.12.020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044644161 / rank | |||
Normal rank | |||
Revision as of 02:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect |
scientific article |
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
