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]

Authors

Jan Gmys

This author has not been identified. Look up 'Jan Gmys' in Google

Mohand Mezmaz

This author has not been identified. Look up 'Mohand Mezmaz' in Google

Nouredine Melab

This author has not been identified. Look up 'Nouredine Melab' in Google

Daniel Tuyttens

This author has not been identified. Look up 'Daniel Tuyttens' in Google