The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196)
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: The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm |
scientific article; zbMATH DE number 2091686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm |
scientific article; zbMATH DE number 2091686 |
Statements
The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (English)
0 references
16 August 2004
0 references
Flowshop scheduling
0 references
Branch-and-bound
0 references
Lagrangean relaxation
0 references
0 references
0 references
0.9296833276748656
0 references
0.91988343000412
0 references
0.9195394515991212
0 references
0.910271942615509
0 references
0.904165267944336
0 references
