备件供应规划中的最优储备问题分析  

ANALYSIS OF OPTIMAL SPARES SUPPLY PROGRAMMING

作　　者：周江华[1] 肖刚[1] 苗育红[1] 

机构地区：[1]第二炮兵工程学院603教研室,西安710025

出　　处：《机械强度》2004年第3期270-273,共4页Journal of Mechanical Strength

基　　金：国家自然科学基金资助项目 (70 1 71 0 2 9)~~

摘　　要：讨论备件供应规划中经常遇到的一类系统———n :k(m)型系统的最优储备问题。首先用一个有限排队时间的双队列、双服务中心 ,每个服务中心含有多个服务器的闭环排队网络 ,给出系统逻辑过程的通用描述 ,在此基础上用排队分析法给出马尔可夫型n :k(m)系统最优储备问题的解析计算公式 ,由这些公式可很方便地求解系统在保障率指标约束下的最优储备问题。文末给出一些典型实例的最优储备问题分析 ,并与用MonteCarlo仿真方法所得结果进行比较 。Analysis of optimal spares supply problems of n:k(m) system which is commonly meet in spares supply programming are discussed. A closed finite waiting time queuing network with two queue and two server centers that both of them have multiply servers is used to describe logical behavior of the n:k(m) system. Then, formulae for analysis optimal spares supply problems of Markovian n:k(m) system are derived based on queue theory. By these formulae, optimal spares supply of n:k(m) system can be determined conveniently. Finally, optimal spares supply problems of several typical application cases are analyzed, and the analytical results are compared with the results from simulation (Monte Carlo) approach. The comparison shows the effectiveness of the proposed formulae.

关 键 词：排队网络 马尔可夫系统 优化 可靠性 

分 类 号：O213.2[理学—概率论与数理统计] TB114.3[理学—数学]