Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem
Crossref DOI link: https://doi.org/10.1007/s10479-014-1667-6
Published Online: 2014-07-11
Published Print: 2015-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Keshavarz, Taha
Salmasi, Nasser
Varmazyar, Mohsen
Text and Data Mining valid from 2014-07-11