Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem
Crossref DOI link: https://doi.org/10.1007/s12351-020-00577-3
Published Online: 2020-06-20
Published Print: 2022-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Nasrollahi, Vahid
Moslehi, Ghasem
Reisi-Nafchi, Mohammad
Text and Data Mining valid from 2020-06-20
Version of Record valid from 2020-06-20
Article History
Received: 13 November 2018
Revised: 27 April 2020
Accepted: 4 June 2020
First Online: 20 June 2020