The time dependent machine makespan problem is strongly NP-complete (Q1304510)
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: The time dependent machine makespan problem is strongly NP-complete |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The time dependent machine makespan problem is strongly NP-complete |
scientific article |
Statements
The time dependent machine makespan problem is strongly NP-complete (English)
0 references
22 September 1999
0 references
sequencing
0 references
time dependence
0 references
