Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (10): 35-37.
• 学术探讨 • Previous Articles Next Articles
jianjun xiong
Received:
Revised:
Online:
Published:
Contact:
熊健俊 张建明 张强 魏小鹏
通讯作者:
Abstract: Abstract:A graph model for Job_Shop scheduling is established by describing the scheduling scheme as a weighted directed graph. The validity of scheduling scheme is judged by topological queuing and the key job is extracted based on the key path. The improved genetic algorithm is subsequently presented for Job_Shop scheduling. The chromosome is coded with the constrained planar array and the evaluation function is computed with topological queuing. The operations of crossover and mutation are also directed by the key job. An example is given to demonstrate the proposed algorithm by comparing it with the other genetic algorithms presented in preterit articles.
摘要: 摘要:通过把调度方案表示成基于约束的图模型,在遗传算法求解过程中,采用了基于约束的二维数组编码方式,使算法的通用性得到提高。借助拓扑排序来判断个体的合法性及进行适应度的求解,在交叉和变异算子中引入关键工序的指导,缩小搜索空间从而提高了算法求解的效率和质量。最后给出相应实例,并与其它文献中的方法比较验证了本文算法的可行性和有效性。
jianjun xiong. The Graph Representation and Improved Genetic Algorithm for Job_shop Scheduling[J]. Computer Engineering and Applications, 2007, 43(10): 35-37.
熊健俊 张建明 张强 魏小鹏. Job_Shop调度的图表示模型与改进GA求解[J]. 计算机工程与应用, 2007, 43(10): 35-37.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I10/35