A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185)
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: A branch and bound algorithm for the two-stage assembly scheduling problem |
scientific article; zbMATH DE number 1260446
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the two-stage assembly scheduling problem |
scientific article; zbMATH DE number 1260446 |
Statements
A branch and bound algorithm for the two-stage assembly scheduling problem (English)
0 references
6 October 1999
0 references
branch and bound
0 references
two-stage assembly scheduling
0 references
maximum completion time
0 references
makespan
0 references
0 references
0 references
0.9467574
0 references
0.9420697
0 references
0.9023881
0 references
0.9014523
0 references
0.9003166
0 references
0.8869771
0 references
0.8846671
0 references
