Hamdi, Imen; Toumi, Saïd - In: Journal of industrial engineering international 15 (2019), pp. 223-229
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...