Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
Crossref DOI link: https://doi.org/10.1007/s12351-014-0166-5
Published Online: 2014-12-09
Published Print: 2015-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hamdi, Imen
Loukil, Taicir
Text and Data Mining valid from 2014-12-09