The time dependent machine makespan problem is strongly NP-complete (Q1304510): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:16, 31 January 2024
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
