Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Crossref DOI link: https://doi.org/10.1007/s00224-019-09910-6
Published Online: 2019-02-18
Published Print: 2020-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Henning, Sören
Jansen, Klaus
Rau, Malin http://orcid.org/0000-0002-5710-560X
Schmarje, Lars
Funding for this research was provided by:
Deutsche Forschungsgemeinschaft (JA 612 /14-2)
Deutsche Forschungsgemeinschaft (JA 612 /15-2)
Deutsche Forschungsgemeinschaft (JA 612/20-1)
Text and Data Mining valid from 2019-02-18
Article History
First Online: 18 February 2019