A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF
Crossref DOI link: https://doi.org/10.1007/s11241-018-9319-6
Published Online: 2018-10-26
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Leoncini, Mauro
Montangero, Manuela http://orcid.org/0000-0001-8827-5495
Valente, Paolo
Text and Data Mining valid from 2018-10-26
Article History
First Online: 26 October 2018