A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q288238 |
||
| Property / author | |||
| Property / author: Daniel Tuyttens / rank | |||
Revision as of 19:08, 12 February 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
