A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time
Crossref DOI link: https://doi.org/10.1007/s10951-019-00602-0
Published Online: 2019-02-02
Published Print: 2019-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Wang, Tianyu http://orcid.org/0000-0001-6250-3656
Bellenguez-Morineau, Odile
Funding for this research was provided by:
China Sponsorship Council (201404490037)
Text and Data Mining valid from 2019-02-02
Article History
First Online: 2 February 2019