Marcus Ritt. A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem. In IEEE International Conference on Automation Science and Engineering, CASE 2016, Fort Worth, TX, USA, August 21-25, 2016. pages 872-877, IEEE, 2016. [doi]
Abstract is missing.