检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:喻春明[1] 迟玉红[2] 方艳东[2] 刘杰[1]
机构地区:[1]东北大学机械工程与自动化学院,辽宁沈阳110004 [2]中国人民解放军65053部队,辽宁大连116113
出 处:《东北大学学报(自然科学版)》2008年第11期1617-1620,共4页Journal of Northeastern University(Natural Science)
基 金:国家自然科学基金资助项目(50775029)
摘 要:战时装备抢修的任务调度问题是跟排队论、任务指派与动态规划有关的交叉问题,具有一定的代表性,可归结为排队系统的非平衡动态任务指派问题.该问题目前尚无简便有效的求解方法.结合动态规划与匈牙利算法的优势,提出了剖面降维、补项截余、消元归简的三步法,将原命题逐步分解转换为已知求解方式的问题,简化了运算过程.最后,以坦克团的一次进攻战斗为实例,利用Matlab软件实现的装备战损及抢修仿真,验证了此法的可用性和有效性.Task scheduling for wartime equipment recovery/maintenance, as an interdisciplinary project combining the queuing theory, task assignment and dynamic programming, is typically a nonequilibrium dynamic assignment problem to which no simple and valid solution has been found up to now. By virtues of the advantages of dynamic programming and Hungary algorithm, a new way named the three-step method is proposed, i. e., sectional dimensionality reduction, complement patch-cut and elimination-predigestion. Thus, the problem to be solved is transformed into such a problem to which the mode of solution is known. With an attack executed by tank regiment as example, the software Matlab is used to simulate the equipment damage and recovery/maintenance in wartime, and the results verify the feasibility and validity of the method proposed.
关 键 词:任务调度 排队系统 非平衡动态指派 战时仿真 维修仿真
分 类 号:TH17[机械工程—机械制造及自动化] O22[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15