期刊
APPLIED SOFT COMPUTING
卷 12, 期 2, 页码 652-662出版社
ELSEVIER
DOI: 10.1016/j.asoc.2011.09.021
关键词
Permutation flowshop; Blocking; Makespan; Discrete particle swarm optimization
资金
- National Natural Science Foundation of China [71032004, 70902065]
- National Science Foundation for Post-doctoral Scientists of China [20100481197]
- Fundamental Research Funds for the Central Universities [N090404018]
This paper proposes a discrete particle swarm optimization (DPSO) algorithm for the m-machine permutation flowshop scheduling problem with blocking to minimize the makespan, which has a strong industrial background, e. g., many production processes of chemicals and pharmaceuticals in chemical industry can be reduced to this problem. To prevent the DPSO from premature convergence, a self-adaptive diversity control strategy is adopted to diversify the population when necessary by adding a random perturbation to the velocity of each particle according to a probability controlled by the diversity of the current population. In addition, a stochastic variable neighborhood search is used as the local search to improve the search intensification. Computational results using benchmark problems show that the proposed DPSO algorithm outperforms previous algorithms proposed in the literature and that it can obtain 111 new best known upper bounds for the 120 benchmark problems. (C) 2011 Elsevier B. V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据