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
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6036028 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
deteriorating | |||
| Property / zbMATH Keywords: deteriorating / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
aging effect | |||
| Property / zbMATH Keywords: aging effect / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
computational complexity | |||
| Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Revision as of 21:05, 29 June 2023
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
