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.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.