A new approach for solving the flow‐shop scheduling problem using a parallel optimization algorithm
Crossref DOI link: https://doi.org/10.1007/s12652-020-02881-4
Published Online: 2021-02-11
Published Print: 2021-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nazif, Habibeh https://orcid.org/0000-0002-9690-6354
Text and Data Mining valid from 2021-02-11
Version of Record valid from 2021-02-11
Article History
Received: 8 January 2020
Accepted: 23 December 2020
First Online: 11 February 2021