The time dependent machine makespan problem is strongly NP-complete (Q1304510): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:51, 5 March 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