MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
Crossref DOI link: https://doi.org/10.1007/s40092-019-00331-1
Published Online: 2019-10-22
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hamdi, Imen
Toumi, Saïd
Text and Data Mining valid from 2019-10-22
Version of Record valid from 2019-10-22
Article History
Received: 10 May 2019
Accepted: 10 October 2019
First Online: 22 October 2019