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

Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens. A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. European Journal of Operational Research, 284(3):814-833, 2020. [doi]

Abstract

Abstract is missing.