Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags | IEEE Conference Publication | IEEE Xplore