A robust hybrid method for the multimode resource-constrained project scheduling problem

This paper presents the computational results of a robust hybrid algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP). In the presented approach a harmony search algorithm is combined with a new and effective ‘head-tail’ local search procedure based on a mixed integer linear programming (MILP) formulation. In order to illustrate the essence and viability of the proposed new approach, the computational results for the J30MM set from PSPLIB are reported. J30MM is the one of the ‘hardest’ multi-mode benchmark set of PSPLIB generated by Kolish and Sprecher