Inapproximability results for no-wait job shop scheduling. (Q703234)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inapproximability results for no-wait job shop scheduling. |
scientific article; zbMATH DE number 2125888
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability results for no-wait job shop scheduling. |
scientific article; zbMATH DE number 2125888 |
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
