# A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem

> Research article (European Journal of Operational Research, 2020) · cited 80× · AI/ML

**Wikidata**: [openalex:W3001967193](https://www.wikidata.org/wiki/openalex:W3001967193)  
**Source**: https://4ort.xyz/entity/a-computationally-efficient-branch-and-bound-algorithm-for-the-permutation-flow-shop-scheduling-problem