Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-approximability of precedence-constrained sequencing to minimize setups. |
scientific article |
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
