The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969)
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: branch-and-bound algorithms based on network-flow formulation |
scientific article; zbMATH DE number 6636257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation |
scientific article; zbMATH DE number 6636257 |
Statements
The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (English)
0 references
7 October 2016
0 references
scheduling
0 references
flowshop
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9579628
0 references
0.9466275
0 references
0.93218213
0 references
0.92810553
0 references
0.9276742
0 references
0.9191233
0 references
0.91723675
0 references
0.9134853
0 references
0.9128283
0 references
