Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays

DOI10.1016/j.apm.2014.01.006zbMath1428.90064MaRDI QIDQ1631999

Y. Aharonov

Publication date: 12 December 2018

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.01.006

zbMATH Keywords

branch-and-bound algorithm; scheduling; parallel processors; communication delay

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Uses Software

• CPLEX