.png){kind=icon}
返回
Multi-objective energy-aware batch scheduling using ant colony optimization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2019.03.033.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A Abstracted from industrial manufacturing process, scheduling on batch processing machines (BPMs) is known to be an NP-hard discrete optimization problem. Therefore, researchers have resorted to meta-heuristics to tackle such challenging tasks. This paper investigates the scheduling problem on a set of BPMs, arranged in parallel, which have different processing powers. The jobs have different sizes, processing times and release times. A bi-objective ant colony optimization algorithm is proposed to minimize the makespan and the total energy consumption. Due to the complex constraints in the problem, how to find a feasible solution is a challenging issue in discrete optimization. Thus, an effective method to construct the feasible solutions is presented so that the ant colony only needs to focus on the promising area in the search space. Additionally, the user's preferences are incorporated to build the solutions. Furthermore, a neighborhood-based local optimization is used to improve the solutions so that the exploration and exploitation capabilities of the ant colony are able to be exerted adequately. The proposed algorithm is verified by elaborately designed simulations. The results show that the proposed algorithm provides the better solutions than the state-of-the-art algorithms, especially on large-scale problems.
Keyword:
Ant colony optimization
Batch scheduling
Multi-objective optimization
Makespan
Energy consumption
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)一种求解多目标资源分配问题 (MORAP) 的有效蚁群优化算法 (ACO)
PREAI
分享收藏分享收藏
查看更多内容