The worst-case analysis of the Garey-Johnson algorithm (Q2268512)
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 5678452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The worst-case analysis of the Garey-Johnson algorithm |
scientific article; zbMATH DE number 5678452 |
Statements
The worst-case analysis of the Garey-Johnson algorithm (English)
0 references
8 March 2010
0 references
scheduling
0 references
parallel machines
0 references
UET tasks
0 references
precedence constraints
0 references
maximum lateness
0 references
0 references
0 references
0.865889847278595
0 references
0.8053246140480042
0 references
0.7908008694648743
0 references
0.790480375289917
0 references
