![](/img/cover-not-exists.png)
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Gmys, Jan, Mezmaz, Mohand, Melab, Nouredine, Tuyttens, DanielLanguage:
english
Journal:
European Journal of Operational Research
DOI:
10.1016/j.ejor.2020.01.039
Date:
January, 2020
File:
PDF, 1.53 MB
english, 2020