The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
Crossref DOI link: https://doi.org/10.1007/s10951-016-0507-8
Published Online: 2017-02-14
Published Print: 2017-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Carlier, Aurélien
Hanen, Claire
Kordon, Alix Munier
License valid from 2017-02-14