Branch and bound algorithm for the flow shop with multiple processors (Q809880)
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: Branch and bound algorithm for the flow shop with multiple processors |
scientific article; zbMATH DE number 4211782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch and bound algorithm for the flow shop with multiple processors |
scientific article; zbMATH DE number 4211782 |
Statements
Branch and bound algorithm for the flow shop with multiple processors (English)
0 references
1991
0 references
sequencing
0 references
flow shop
0 references
multiple processors
0 references
branch and bound
0 references
maximum completion time
0 references
lower bounds
0 references
0 references
0.8555581569671631
0 references
0.8531820774078369
0 references
0.8442487716674805
0 references
0.8403898477554321
0 references
0.8310396075248718
0 references
