Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown
Crossref DOI link: https://doi.org/10.1007/s10479-023-05324-3
Published Online: 2023-06-09
Published Print: 2023-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hnaien, Faicel
Arbaoui, Taha http://orcid.org/0000-0001-8984-2375
Text and Data Mining valid from 2023-06-09
Version of Record valid from 2023-06-09
Article History
Accepted: 24 March 2023
First Online: 9 June 2023