Performance of critical path type algorithms for scheduling on parallel processors

AbstractThe Brucker-Garey-Johnson algorithm and Hu’s algorithm are based on the idea of the critical path method and were developed for the model with unit execution time tasks, precedence constraints and parallel identical processors. The performance guarantees for these algorithms have been presented in Singh and Zinder (2000a, 2000b). We present upper bounds for the Brucker-Garey-Johnson algorithm with communication delays, which can be seen as a generalization of the performance guarantees in Singh and Zinder (2000a, 2000b). As a particular case this also gives performance guarantees for Hu’s algorithm with communication delays and therefore, also generalizes the previously known performance guarantees for this algorithm