Scheduling N jobs with non-identical job sizes from F families on M parallel BPMs is considered.
The objective is to minimize the makespan.
A meta-heuristic based on MMAS combined with the Multi-Fit algorithm is presented.
The performance of the algorithm is compared with several previously studied algorithms.
Our results show that the proposed algorithm outperforms the previously studied algorithms.