Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925)
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: Heuristics for the two-stage job shop scheduling problem with a bottleneck machine |
scientific article; zbMATH DE number 1471177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the two-stage job shop scheduling problem with a bottleneck machine |
scientific article; zbMATH DE number 1471177 |
Statements
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (English)
0 references
3 September 2001
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0 references
0 references
0 references
0.90392303
0 references
0.89925474
0 references
0 references
0.89162815
0 references
0.8912893
0 references
0.89041585
0 references
0.8878039
0 references
0.88428354
0 references
