Hamdi I, Loukil T. Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness. Int. Journal of COP and Infor. [Internet]. 2014 Apr. 11 [cited 2024 Nov. 24];5(2):47-5. Available from: https://ijcopi.org/ojs/article/view/84