Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities
详细信息 查看全文
- 作者：Zhaohong Jiaa ; zhjia@mail.ustc.edu.cn" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Xiaohao Lia ; lixiaohaoahu@163.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Joseph Y.-T. Leungb ; c ; leung@njit.edu" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae
- 关键词：Scheduling ; Parallel batch machines with arbitrary capacities ; Release times ; Makespan ; Ant colony optimization
- 刊名：Future Generation Computer Systems
- 出版年：2017
- 出版时间：February 2017
- 年：2017
- 卷：67
- 期：Complete
- 页码：22-34
- 全文大小：1134 K
文摘
- class="listitem" id="list_l000005">
- class="label">•
Scheduling a set of jobs with arbitrary job sizes and release times on a set of P-batch machines with non-identical capacities is considered.
- class="label">•
The objective is to minimize the makespan.
- class="label">•
Two ACO-based meta-heuristics are proposed to solve the problem.
- class="label">•
The heuristics are evaluated against a lower bound and with each other by computational experiments.