同顺序排序问题近似最优解的一种简便解法  

The New Simple Method for Approximate Optimalsolution of Permutation Schedule Problem

作　　者：贾春玉[1] 朴惠淑[2] 

机构地区：[1]宁波工程学院经济与管理学院,浙江宁波315016 [2]大连海事大学交通运输管理学院,辽宁大连116026

出　　处：《成组技术与生产现代化》2015年第2期18-22,共5页Group Technology & Production Modernization

基　　金：国家自然科学基金资助项目(71271035)

摘　　要：为了解决传统的同顺序m×n排序问题近似最优解解法优化程度不高且步骤繁琐这一问题,提出一种新的近似最优解简便解法.该方法在分析最小系数法、关键零件法和关键加工中心法利弊的基础上,兼顾3种方法的优点,克服三者缺点,综合提出了优化程度更高的简便解法,并从图论、概率论及仿真试验角度证明,该方法使用效果良好.To improve the optimal extent and to reduce the steps of solution in the traditional approximate optimal solution for permutation scheduling, the simple method was proposed. The method anlyses the advantages and disadvantages of minimum coefficient method ;key component method; the disadvantages of those methods. This method makes the critical paths shorter and gets a higher degree of optimization. The result is highly close to optimal solution at most time. This method has good result and can he proved by using Graphic theory and Probability theory.

关 键 词：同顺序排序 关键零件法 关键加工中心法 最小系数法 简便解法 

分 类 号：O226[理学—运筹学与控制论]