A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
Authors:
- Imen HamdiIHImen Hamdi
- Ammar OulamaraAOAmmar Oulamara
- Taïcir LoukilTLTaïcir Loukil
- 1 January 2015
- journal article
- Published by Inderscience Publishers in International Journal of Operational Research
- Vol. 23 (4) , 387