The time dependent machine makespan problem is strongly NP-complete (Q1304510): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Qing Ding / rank | |||
Normal rank | |||
Revision as of 22:02, 9 February 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
