An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families
详细信息 查看全文
- 作者：Zhao-hong Jiaa ; b ; zhjia@mail.ustc.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Chao Wangb ; chaowang_ahu@163.com" class="auth_mail" title="E-mail the corresponding author ; Joseph Y.-T. Leungc ; d ; leung@njit.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Parallel batch machines ; Max&ndash ; Min Ant System ; NP-hard ; Incompatible job families ; Makespan
- 刊名：Applied Soft Computing
- 出版年：2016
- 出版时间：January 2016
- 年：2016
- 卷：38
- 期：Complete
- 页码：395-404
- 全文大小：1498 K
文摘
- •
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.