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]
@article{GmysMMT20,
title = {A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem},
author = {Jan Gmys and Mohand Mezmaz and Nouredine Melab and Daniel Tuyttens},
year = {2020},
doi = {10.1016/j.ejor.2020.01.039},
url = {https://doi.org/10.1016/j.ejor.2020.01.039},
researchr = {https://researchr.org/publication/GmysMMT20},
cites = {0},
citedby = {0},
journal = {European Journal of Operational Research},
volume = {284},
number = {3},
pages = {814-833},
}