A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop
Crossref DOI link: https://doi.org/10.1007/s11740-017-0747-2
Published Online: 2017-06-23
Published Print: 2017-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nagano, Marcelo Seido
Rossi, Fernando Luis
Tomazella, Caio Paziani
Funding for this research was provided by:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) (448161/2014-1, 308047/2014-1)
License valid from 2017-06-23