Concurrent flowshop scheduling to minimize makespan. (Q1429959)
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 2066869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concurrent flowshop scheduling to minimize makespan. |
scientific article; zbMATH DE number 2066869 |
Statements
Concurrent flowshop scheduling to minimize makespan. (English)
0 references
27 May 2004
0 references
Flowshop scheduling
0 references
Concurrent operations
0 references
Approximation/heuristic
0 references
Worst case analysis
0 references
0 references
0 references
0.9163271
0 references
0.91065586
0 references
0.89692754
0 references
0.8923712
0 references
0.88750136
0 references
0.88724643
0 references
0.88671124
0 references
0.8832316
0 references
0.88301086
0 references
