A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110): Difference between revisions
From MaRDI portal
Latest revision as of 14:44, 22 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem |
scientific article |
Statements
A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (English)
0 references
7 May 2020
0 references
branch-and-bound
0 references
flowshop
0 references
makespan
0 references
parallel computing
0 references
0 references
0 references
0 references
0 references
0 references
0 references