Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion (Q2204271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion |
scientific article; zbMATH DE number 7261383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion |
scientific article; zbMATH DE number 7261383 |
Statements
Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion (English)
0 references
15 October 2020
0 references
Summary: This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.
0 references
flowshop scheduling
0 references
blocking constraints
0 references
permutation flowshops
0 references
lower bound
0 references
branch-and-bound algorithm
0 references
makespan
0 references
0.922410786151886
0 references
0.8702274560928345
0 references
0.8343337178230286
0 references
0.8283893465995789
0 references
