| Article ID: | iaor20172921 |
| Volume: | 11 |
| Issue: | 6 |
| Start Page Number: | 1091 |
| End Page Number: | 1107 |
| Publication Date: | Aug 2017 |
| Journal: | Optimization Letters |
| Authors: | Mladenovic Nenad, Hanafi Sad, Artiba Abdelhakim, Ait El Cadi Abdessamad, Ben Atitallah Rabie |
| Keywords: | optimization, combinatorial optimization, communications, programming: integer, heuristics, networks, programming: mathematical |
In this paper we consider scheduling tasks on a multiprocessor system, taking into account communication delays. We propose a new Mixed Integer Program (MIP) formulation that drastically reduces both the number of variables and the number of constraints, when compared to the best mathematical programming formulations from the literature. In addition, we propose pre‐processing procedures that generates cuts and bounds on all variables, reducing the solution space of the problem as well. Cuts are obtained by using forward and backward critical path method from project management field, while the upper bound is derived from the new greedy heuristic. Computational experience shows advantages of our approach.