工件加工最优排序算法研究——相对优势递推法  

A StUDY ON OP IMAL SOR ING ALGORI HM OF WORKPIECE PROCESSING RELA IVE SUPERIOR RECURRENCE ME HOD

作　　者：李浚圣[1] 周力[2] 徐继镶[2] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004 [2]沈阳大学信息工程学院,沈阳110044

出　　处：《计算机应用与软件》2005年第1期109-111,共3页Computer Applications and Software

摘　　要：本文对世界上仍在研究的N个工件在M台机器上加工的最优排序的理论及其算法问题 ,从相对优势递推的观点进行了研究 ,给出了相应的理论和算法。利用该方法 ,不仅可以解任意多个工件在任意多台机器上加工的最优排序确定 ,并计算出最省时的加工工时 ,其计算机排序工作量要比文中提及的“枚举法排序”少得多。This paper introduced the question of optimal sorting method and its algorithm in machine N parts in M machines in the world that was studied still.This study is already in progress from the viewpoint of relative superior recurrence.This approach can not only determinate the optimal sequence in machining arbitrary number of parts in arbitrary numbers of machine,but also compute the machine hours,which might be less than the “Optimal enumeration method”needed.A S UDY ON OP IMAL SOR ING ALGORI HM OF WORKPIECE PROCESSING RELA IVE SUPERIOR RECURRENCE ME HOD$$$$ 5B Li Junsheng 1,2 Zhou Li 2 Xu Jixiang 2 1(School of Information Science and Engineering,Northeastern University,Shenyang 110004) 2(School of Information Engineering,Shenyang University,Shenyang 110044) Abstract This paper introduced the question of optimal sorting method and its algorithm in machine N parts in M machines in the world that was studied still.This study is already in progress from the viewpoint of relative superior recurrence.This approach can not only determinate the optimal sequence in machining arbitrary number of parts in arbitrary numbers of machine,but also compute the machine hours,which might be less than the “Optimal enumeration method”needed.

关 键 词：最优排序 工件加工 递推法 计算机排序 算法问题 算法研究 枚举法 相对优势 工时 理论 

分 类 号：TP317.2[自动化与计算机技术—计算机软件与理论] O223[自动化与计算机技术—计算机科学与技术]