The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints
Crossref DOI link: https://doi.org/10.1007/s10951-018-0596-7
Published Online: 2019-01-02
Published Print: 2019-06
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 Scholarship Council (201404490037)
Text and Data Mining valid from 2019-01-02
Article History
First Online: 2 January 2019