期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An Estimation Method for Kill Probability Based on Random Residence Time Series
1
作者 刘超 王军 郭治 《Defence Technology(防务技术)》 SCIE EI CAS 2011年第4期229-234,共6页
Relations between statistical residence time series and effective shooting are analyzed in accordance with the properties of the random residence time of maneuver targets crossing shot area in a given time. An estimat... Relations between statistical residence time series and effective shooting are analyzed in accordance with the properties of the random residence time of maneuver targets crossing shot area in a given time. An estimation method for kill probability is proposed, which solves the probability of number of residence times satisfied effective shooting in given time. Some expressions and their approximate formulae of kill probability are derived, under known the distribution of residence time series. Theoretical analysis and simulation results show that this method is suitable for evaluating the hit ability of fire system for maneuver targets in random shooting. 展开更多
关键词 probability theory kill probability shooting area residence time Poisson process Gamma distribution
在线阅读 下载PDF
Scheduling algorithm of dual-armed cluster tools with residency time and reentrant constraints 被引量:6
2
作者 周炳海 高忠顺 陈佳 《Journal of Central South University》 SCIE EI CAS 2014年第1期160-166,共7页
To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating sched... To solve the scheduling problem of dual-armed cluster tools for wafer fabrications with residency time and reentrant constraints,a heuristic scheduling algorithm was developed.Firstly,on the basis of formulating scheduling problems domain of dual-armed cluster tools,a non-integer programming model was set up with a minimizing objective function of the makespan.Combining characteristics of residency time and reentrant constraints,a scheduling algorithm of searching the optimal operation path of dual-armed transport module was presented under many kinds of robotic scheduling paths for dual-armed cluster tools.Finally,the experiments were designed to evaluate the proposed algorithm.The results show that the proposed algorithm is feasible and efficient for obtaining an optimal scheduling solution of dual-armed cluster tools with residency time and reentrant constraints. 展开更多
关键词 dual-armed cluster tools scheduling residency time constraints reentrancy heuristic algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部