The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
scientific article

    Statements

    Identifiers