Minimizing total completion time in the two-machine no-idle no-wait flow shop problem
Crossref DOI link: https://doi.org/10.1007/s10732-019-09430-z
Published Online: 2019-10-29
Published Print: 2021-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Della Croce, Federico https://orcid.org/0000-0003-2897-183X
Grosso, Andrea
Salassa, Fabio
Funding for this research was provided by:
Ministero dell’Istruzione, dell’Università e della Ricerca (TESUN-83486178370409)
Text and Data Mining valid from 2019-10-29
Version of Record valid from 2019-10-29
Article History
Received: 22 November 2018
Revised: 16 July 2019
Accepted: 22 October 2019
First Online: 29 October 2019