Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5211581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of shop-scheduling problems with fixed number of jobs: a survey |
scientific article; zbMATH DE number 5211581 |
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
0.8988227248191833
0 references
0.8937109708786011
0 references
0.8737072944641113
0 references
0.872892439365387
0 references
