期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 123, 期 -, 页码 67-81出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2018.06.018
关键词
Batch-processing machine; Non-identical job sizes; Scheduling; Particle swarm optimization
资金
- Natural Science Foundation of Zhejiang Province [LY18G010012]
This paper presents a modified particle swarm optimization (MPSO) algorithm to minimize the maximum lateness for the single batch-processing machine problem with non-identical job sizes and release dates. The MPSO algorithm incorporated a diversification and a local search strategy into a basic particle swarm optimization algorithm. This incorporation enables the proposed algorithm to have a good balance between exploration and exploitation that yields high search efficiency. Additionally, a dynamic programming method is proposed to calculate a relevant value for each particle. The MPSO algorithm was tested in problems from the literature without release dates and newly generated problems with release dates. Computational results show the advantages of combining the diversification strategy, and local search methods. The performance of the proposed MPSO is competitive. For the problems without release dates, the MPSO algorithm could find 80 optimal solutions and improve 68 solutions for all benchmark instances. For the problems with job release dates, the MPSO algorithm also significantly outperformed the other two algorithms with respect to solution quality within the same computational time.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据