Can Akkan, Selçuk Karabati. The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. European Journal of Operational Research, 159(2):420-429, 2004. [doi]
@article{AkkanK04,
title = {The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm},
author = {Can Akkan and Selçuk Karabati},
year = {2004},
doi = {10.1016/S0377-2217(03)00415-6},
url = {http://dx.doi.org/10.1016/S0377-2217(03)00415-6},
researchr = {https://researchr.org/publication/AkkanK04},
cites = {0},
citedby = {0},
journal = {European Journal of Operational Research},
volume = {159},
number = {2},
pages = {420-429},
}