Hamdi, Imen, and Taıcir Loukil. “Bounds for the Permutation Flowshop Scheduling Problem With Exact Time Lags to Minimize the Total Earliness and Tardiness”. International Journal of Combinatorial Optimization Problems and Informatics 5, no. 2 (April 11, 2014): 47–57. Accessed April 20, 2024. https://ijcopi.org/ojs/article/view/84.