The time dependent machine makespan problem is strongly NP-complete (Q1304510): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
| Property / author | |||
| Property / author: Qing Ding / rank | |||
| Property / author | |||
| Property / author: Cheng, T. C. Edwin / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Qing Ding / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(98)00093-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022314204 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 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
