A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (Q1941204)
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 a scheduling problem with position dependent job processing times |
scientific article; zbMATH DE number 6143322
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times |
scientific article; zbMATH DE number 6143322 |
Statements
A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times (English)
0 references
12 March 2013
0 references
computational analysis
0 references
strong NP-hardness
0 references
scheduling
0 references
learning effect
0 references
position-dependent processing time
0 references
