期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 131, 期 -, 页码 41-56出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2019.03.033
关键词
Ant colony optimization; Batch scheduling; Multi-objective optimization; Makespan; Energy consumption
资金
- National Natural Science Foundation [71601001, 71671168]
- Humanity and Social Science Youth Foundation of Ministry of Education of China [15YJC630041]
- Natural Science Foundation of Anhui Province [1608085MG154]
- Natural Science Foundation of Anhui Provincial Department of Education [KJ2015A062]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据