A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Crossref DOI link: https://doi.org/10.1007/s12351-017-0308-7
Published Online: 2017-04-11
Published Print: 2020-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Rakrouki, Mohamed Ali
Kooli, Anis
Chalghoumi, Sabrine
Ladhari, Talel
Text and Data Mining valid from 2017-04-11
Article History
Received: 26 July 2015
Revised: 6 March 2017
Accepted: 9 March 2017
First Online: 11 April 2017