Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of shop-scheduling problems with fixed number of jobs: a survey |
scientific article |
Statements
Complexity of shop-scheduling problems with fixed number of jobs: a survey (English)
0 references
14 November 2007
0 references
asymptotical complexity
0 references
polynomial time
0 references
0 references
0 references
