.png){kind=icon}
返回
Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2020.104951.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The flexible job shop scheduling problem (FJSP) is a typical scheduling problem in practical production and has been proven to be a NP-hard problem. The study of FJSP is important to remarkably direct actual manufacturing processes. The paper proposes an improved particle swarm optimization (PSO) algorithm for solving FJSP and obtains beneficial solutions by improvement on encoding/decoding scheme, communication mechanism between particles, and alternate rules of candidate machines of operations. The innovation of encoding/decoding scheme proposes a novel designed chain encoding scheme and a corresponding effective decoding scheme. The chain-based encoding scheme can reasonably convert FJSP to an appropriate operation linked list and the novel designed decoding scheme owns the capacity of further explorering the solution space. The improvement of traditional PSO focuses on the innovation of information communication between particles, besides the modification of algorithm architecture. The amelioration of rules on operated machine selection is carried out based on the critical path of operations research (OR). It promotes algorithm efficiency by only alternating the candidate machines of operations on the critical path. In addition, much parameters tuning work is involved in a series of experiments. The study proposes some tuning schemes of parameters with exact mathematical methods, and these schemes can effectively help find more appropriate parameters. The final experiment results prove that the improved PSO exhibits remarkable ability to solve FJSP. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Flexible job shop scheduling problem
Particle swarm optimization algorithm
Encoding and decoding schemes
Local search
Operations research
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion具有新作业插入的两阶段人工蜂群算法调度柔性作业车间调度问题
PREAI
分享收藏Validity and sensitivity to change of the Patient Specific Functional Scale used during rehabilitation following proximal humeral fracture肱骨近端骨折后康复期间使用的患者特定功能量表变化的有效性和敏感性
PREAI
分享收藏An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems多目标柔性作业车间调度问题的有效混合优化方法
PREAI
分享收藏
查看更多内容