The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Crossref DOI link: https://doi.org/10.1007/s10951-018-0598-5
Published Online: 2018-12-17
Published Print: 2019-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chen, Rubing
Yuan, Jinjiang http://orcid.org/0000-0002-9814-615X
Gao, Yuan
Funding for this research was provided by:
National Natural Science Foundation of China (NSFC (11671368), NSFC (11771406))
Text and Data Mining valid from 2018-12-17
Article History
First Online: 17 December 2018