The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation |
scientific article |
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
