计算机工程与应用Issue(9)：240-242,250,4.DOI:10.3778/j.issn.1002-8331.1109-0165
一种用支持向量机求解 Job-shop 问题方法
Method for solving Job-shop problem applying Support Vector Machine
摘要
Abstract
As a kind of typical problem in production scheduling, the scheduling of Job-shop for machines above 2(m>2)is NP complete and the valid algorithm hasn’t been found until now for large scale Job-shop problems. The feasible scheduling can be obtained by adding guided constraint on the basis of directed graph. A method based on Support Vector Machine is constructed to choose accurately the interchangeable operations by learning small samples to obtain better scheduling. The performance of the algorithm presented can be improved by replenishing special problems during running as supplementary samples for the fol-lowing training. The results of simulation show that the algorithm performs well for Job-shop problem.关键词
支持向量机/Job-shop/约束引导Key words
Support Vector Machine(SVM)/Job-shop/constraint guided分类
信息技术与安全科学引用本文复制引用
李文超,杨宏兵,马涛锋..一种用支持向量机求解 Job-shop 问题方法[J].计算机工程与应用,2013,(9):240-242,250,4.基金项目
国家自然科学基金(No.51005160) （No.51005160）
江苏省高校自然科学研究项目(No.10KJB410001) （No.10KJB410001）
