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 the normal view instead:
scientific article; zbMATH DE number 1339938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The time dependent machine makespan problem is strongly NP-complete |
scientific article; zbMATH DE number 1339938 |
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
0.8614705801010132
0 references
0.8569929599761963
0 references
0.8495186567306519
0 references
