An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q421619 |
Changed an Item |
||
| Property / author | |||
| Property / author: Marco Ghirardi / rank | |||
Normal rank | |||
Revision as of 23:24, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved branch-and-bound algorithm for the two machine total completion time flow shop problem |
scientific article |
Statements
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (English)
0 references
3 July 2002
0 references
flow shop scheduling
0 references
branch-and-bound
0 references
Lagrangean relaxation
0 references
