A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
Crossref DOI link: https://doi.org/10.1007/s10951-015-0460-y
Published Online: 2015-11-13
Published Print: 2016-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhao, Kejun
Lu, Xiwen
Gu, Manzhan
Funding for this research was provided by:
National Natural Science Foundation of China (11371137)
Text and Data Mining valid from 2015-11-13