Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Crossref DOI link: https://doi.org/10.1007/s11590-014-0761-7
Published Online: 2014-06-18
Published Print: 2015-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hamdi, Imen
Loukil, Taïcir
Text and Data Mining valid from 2014-06-18