Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479)
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: Non-approximability of precedence-constrained sequencing to minimize setups. |
scientific article; zbMATH DE number 2032823
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-approximability of precedence-constrained sequencing to minimize setups. |
scientific article; zbMATH DE number 2032823 |
Statements
Non-approximability of precedence-constrained sequencing to minimize setups. (English)
0 references
26 January 2004
0 references
Computational complexity
0 references
Scheduling
0 references
Approximability
0 references
Setup
0 references
Precedence constraint
0 references
0 references
