Inapproximability results for no-wait job shop scheduling. (Q703234)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability results for no-wait job shop scheduling. |
scientific article |
Statements
Inapproximability results for no-wait job shop scheduling. (English)
0 references
11 January 2005
0 references
Approximation algorithms
0 references
APX hardness
0 references
Shop scheduling
0 references
0 references
