A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (Q1758042)
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: A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times |
scientific article; zbMATH DE number 6102940
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times |
scientific article; zbMATH DE number 6102940 |
Statements
A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times (English)
0 references
7 November 2012
0 references
complexity theory
0 references
scheduling
0 references
deteriorating jobs
0 references
makespan
0 references
