Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags. - Imen Hamdi; Taïcir Loukil (CoDIT, 2014)

Bounds for the permutation flowshop scheduling problem with exact time lags to minimize the total earliness and tardiness. - Imen Hamdi (Int. J. Comb. Optim. Probl. Informatics, 2014)

Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. - Imen Hamdi; Taïcir Loukil (Optim. Lett., 2015)

Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags. - Imen Hamdi; Taïcir Loukil (Oper. Res., 2015)

Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling. - Imen Hamdi; Imen Boujneh (J. Comb. Optim., 2022)