解决Job Shop调度问题的遗传算法的实现  

Realization of Genetic Algorithms to Solve Job Shop Scheduling Problem

作　　者：林碧[1] 谢明红[1] 

机构地区：[1]华侨大学机电及自动化学院,福建泉州362021

出　　处：《重庆工学院学报（自然科学版）》2008年第6期73-78,共6页Journal of Chongqing Institute of Technology

基　　金：福建省自然科学基金资助项目(E0640007)

摘　　要：针对作业车间调度问题的具体特点,给出了利用遗传算法求解Job Shop调度问题的主要构造过程和步骤,并对编码、解码、适应度计算、选择、交叉、变异等遗传操作进行了详细设计.最后用一个6×6的测试例子,对本研究设计的GA算法的求解效果进行了测试,并对测试结果进行了分析.Based on the characteristics in Job Shop Scheduing Problem, this paper offers the main structuring process and procedure to solve Job Shop Scheduling Problem by employing Genetic Algorithms and presents the detailed design of the genetic operations such as coding, decoding, calculation of fitness, selection, crossover, and mutation. Finally a test of the solution of GA with a sample of 6 × 6 is given and the result of the test is analyzed.

关 键 词：JOB Shop调度 遗传算法 种群规模 交叉率 变异率 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]