Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
Crossref DOI link: https://doi.org/10.1007/s12351-018-0384-3
Published Online: 2018-02-16
Published Print: 2020-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Khoudi, Asmaa
Berrichi, Ali
Funding for this research was provided by:
AAA Foundation for Traffic Safety
Text and Data Mining valid from 2018-02-16
Version of Record valid from 2018-02-16
Article History
Received: 22 February 2017
Revised: 13 November 2017
Accepted: 31 January 2018
First Online: 16 February 2018