A Novell Shop Planning Algorithm Based on Judge Mechanism

摘要：

By introducing judge mechanism into the encoding of genetic algorithm, we developed a novell evolutionary algorithm to solve the Job-Shop problem. The algorithm is the combination of GA and Heuristic Processings feature. In some extent, the actually result of scheduling showed that the method is perfect on running time and global optimization.

作者: Yong DAI Jing-feng DONG

作者单位: Department of Industry Engineering, Harbin Institute of Technology, Harbin, China Department of Engineering and Technology, Northeast Forest University, Harbin, China

会议类型: 国际会议

会议名称: 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

会议地点: 长春

会议语种:英文

页码: 869-873

在线出版日期: 2011-09-03（万方平台首次上网日期，不代表论文的发表时间）