4.7 Article

A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility

期刊

JOURNAL OF INTELLIGENT MANUFACTURING
卷 28, 期 8, 页码 1961-1972

出版社

SPRINGER
DOI: 10.1007/s10845-015-1082-0

关键词

Particle swarm optimization; Simulated annealing; Dual-resource constraint; Resource flexibility

资金

  1. National Natural Science Foundation of China (NSFC) [61379123]
  2. National Key Technology R&D Program in the 12th Five Year Plan of China [2012BAD10B01]

向作者/读者索取更多资源

In this paper, a novel hybrid discrete particle swarm optimization algorithm is proposed to solve the dual-resource constrained job shop scheduling problem with resource flexibility. Particles are represented based on a three-dimension chromosome coding scheme of operation sequence and resources allocation. Firstly, a mixed population initialization method is used for the particles. Then a discrete particle swarm optimization is designed as the global search process by taking the dual-resources feature into account. Moreover, an improved simulated annealing with variable neighborhoods structure is introduced to improve the local searching ability for the proposed algorithm. Finally, experimental results are given to show the effectiveness of the proposed algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据