期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm 被引量:11
1
作者 WANG Cuiyu LI Yang LI Xinyu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第2期261-271,共11页
The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborativ... The flexible job shop scheduling problem(FJSP),which is NP-hard,widely exists in many manufacturing industries.It is very hard to be solved.A multi-swarm collaborative genetic algorithm(MSCGA)based on the collaborative optimization algorithm is proposed for the FJSP.Multi-population structure is used to independently evolve two sub-problems of the FJSP in the MSCGA.Good operators are adopted and designed to ensure this algorithm to achieve a good performance.Some famous FJSP benchmarks are chosen to evaluate the effectiveness of the MSCGA.The adaptability and superiority of the proposed method are demonstrated by comparing with other reported algorithms. 展开更多
关键词 flexible job shop scheduling problem(FJSP) collaborative genetic algorithm co-evolutionary algorithm
在线阅读 下载PDF
Job shop scheduling problem based on DNA computing
2
作者 Yin Zhixiang Cui Jianzhong Yang Yan Ma Ying 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第3期654-659,共6页
To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, o... To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the "operations" of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. 展开更多
关键词 DNA computing job shop scheduling problem WEIGHTED tournament.
在线阅读 下载PDF
Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck 被引量:21
3
作者 Zuo Yan Gu Hanyu Xi Yugeng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2007年第3期556-565,共10页
A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck (SB) procedure. I... A modified bottleneck-based (MB) heuristic for large-scale job-shop scheduling problems with a welldefined bottleneck is suggested, which is simpler but more tailored than the shifting bottleneck (SB) procedure. In this algorithm, the bottleneck is first scheduled optimally while the non-bottleneck machines are subordinated around the solutions of the bottleneck schedule by some effective dispatching rules. Computational results indicate that the MB heuristic can achieve a better tradeoff between solution quality and computational time compared to SB procedure for medium-size problems. Furthermore, it can obtain a good solution in a short time for large-scale jobshop scheduling problems. 展开更多
关键词 job shop scheduling problem BOTTLENECK shifting bottleneck procedure.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部