求解PERT问题的一种简便算法

本给出了一种用Floyd算法求解PERT问题的算法，使PERT问题的解法变得更加简单方便。     

PERT问题的新算法

本文给出了一种通过求解最长路径解决 PERT问题的新算法 .其优点是 ,编制运算程序之前 ,无需做出系统作业的网络图 ,因此 ,使用起来更加方便     

任务清单的随机优先关键线路确定方法

在PERT网中,通常将具有持续时间最长的线路作为关键线路.从任务完成概率的角度看,这是一种很乐观的态度.但在定下作战决心时,指挥员不会盲目乐观,而会充分考虑可能出现的各种不利因素.从给予任务完成最薄弱环节更多关注的角度出发,分析了PERT网随机优先的概念,描述了任务完成概率的最小上边界,提出了随机优先关键线路的计算方法.结论是:应根据指挥员对完成任务的不同态度,选择更加合适的关键线路确定方法,定下作战决心.     

非肯定型PERT网络分析

本文用一个具体示例说明非肯定型PERT网络中原来一般方法的不足 ,提出用仿真方法解决这问题     

统筹方法中时间分布律的讨论

<正> 表示任务的完成时间 X 的数学期望和方差,那么 X 应服从什么分布呢?美国“计划评审技术”(PERT)工作者说是β分布,[1]指出是有条件的β分布,华罗庚教授在[2]中指出,经过验算无法接受 PERT 的结论,并提出应用概率论中的极限定理,假设是正态分布,最后希望数学工作者能够进行理论的探讨.本文从获得最大平均信息量的观点,找出了 X应服从截尾的正态分布律.     

再论筹方法中活动延续时间的统计学性质

In this paper attempts are made at answering the problems on the statistical properties of activity flow time in PERT raised by the late famous mathematician Hua Loo-keng.     

随机网络计划在审计中的应用

审计作为市场经济的自我约束机制,在经济发展中有着不可或缺的责任.本文利用随机网络技术进行分析,旨在设计出高效率的审计活动方案.首先,利用PERT技术建立了确定型的审计活动模型,在此基础上给出了时间—资源优化下的最优人员分配方案;其次,利用GERT技术建立了随机型的审计活动模型,引入矩母函数和梅森公式进行GERT解析求解求出所需的工期等指标,同时采用蒙特卡罗模拟求解验证解析求解的准确性,为审计活动的工期控制提供了理论依据.最后对于工作时间确定的GERT模型,结合PERT和GERT两种技术对其进行简化分析,从而得到了时间—资源优化下的最优人员分配方案.     

马尔可夫骨架PERT网络的最长路径

本文利用马尔可夫骨架过程理论研究PERT网络模型，其中网络各弧线的长度是相互独立的随机变量。文中构造了一个马尔可夫骨架过程，利用其向后方程求解随机网络最长路径长度的分布函数。     

改进的随机PERT下寻找关键路径的新方法

改进了随机PERT下寻找关键路径的方法.定义了随机路径时间变量的比较原则并据此确定概率关键路径;利用关于正态分布函数的不等式能对联合概率高精度估计的特性验证了概率关键指数较小时的概率关键路径的可信度;最后,实例阐明了随机关键路径方法.     

航空复杂产品项目活动时间混合分布估算模型的改进

航空复杂产品开发项目具有复杂性、随机性、多目标性的特点,并且产品本身小批量、多品种的生产模式使得无法大量积累历史数据。因此,航空复杂产品项目活动时间存在高度的不确定性。如何能够更加合理、准确的描述其项目活动时间,对优化航空复杂产品的研制过程、缩短研制周期以及降低研制成本具有重大的意义。本文在Hahn基于PERT所建立的Beta Rectangular混合分布模型的基础上,保留其期望值的表达式,对其方差表达式进行改进。按照Malcolm、José等人的思想,将最可能值m与Beta分布的众数相对应,并且考虑其对方差的影响。仅保留PERT的一个假设,使方差的推导更多地依照于Beta分布而不是较多的近似。仿真结果表明,改进后的混合分布模型不但更具柔性,而且可以更加科学准确地描述航空复杂产品调度中高度不确定的任务持续时间状况。     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Maximal and Minimal Semilattices on Ordered Sets

The map which takes an element of an ordered set to its principal ideal is a natural embedding of that ordered set into its powerset, a semilattice. If attention is restricted to all finite intersections of the principal ideals of the original ordered set, then an embedding into a much smaller semilattice is obtained. In this paper the question is answered of when this construction is, in a certain arrow-theoretic sense, minimal. Specifically, a characterisation is given, in terms of ideals and filters, of those ordered sets which admit a so-called minimal embedding into a semilattice. Similarly, a candidate maximal semilattice on an ordered set can be constructed from the principal filters of its elements. A characterisation of those ordered sets that extend to a maximal semilattice is given. Finally, the notion of a free semilattice on an ordered set is given, and it is shown that the candidate maximal semilattice in the embedding-theoretic sense is the free object.     

Optimal damping ratio for linear second-order systems

In this paper, it is shown that the optimal damping ratio for linear second-order systems that results in minimum-time no-overshoot response to step inputs is of bang-bang type. The optimal damping ratio is zero at the outset and is switched to some maximum value at an appropriate instant of time. The switching time is shown to be a function of the maximum damping ratio and the system natural frequency. Furthermore, it is shown that the larger the maximum damping ratio is, the shorter it takes for the system to reach the desired set point. Finally, it is shown that, if the optimal damping ratio is switched as a function of the system state, then the minimum-time no-overshoot criterion is satisfied, irrespective of the magnitude of the uncertainty in the value of the system natural frequency.     

AR（p）模型中的缺失数据估计

运用EM算法,对含有缺失数据的AR（p）模型进行参数估计,通过最大似然准则就非左端缺失的情况进行插补.最后,用蒙特卡洛方法给出实验分析,表明如下结果：（i）误差与AR模型的阶数正相关,与缺失比例正相关;（ii）当AR模型的特征根模长相对较小时,误差与数据长度负相关,且误差被控制在了标准差的30％以内;（iii）当模长中等时,误差基本控制在1个标准差左右;（iv）当模长较大时,误差与数据长度正相关,而且误差也相对较大.     

On stability of switched homogeneous nonlinear systems

In this paper, the problem of stability of switched homogeneous systems is addressed. First of all, if there is a quadratic Lyapunov function such that nonlinear homogeneous systems are asymptotically stable, a matrix Lyapunov-like equation is obtained for a stable nonlinear homogeneous system using semi-tensor product of matrices, and Lyapunov equation of linear system is just its particular case. Following the previous results, a sufficient condition is obtained for stability of switched nonlinear homogeneous systems, and a switching law is designed by partition of state space. In particular, a constructive approach is provided to avoid chattering phenomena which is caused by the switching rule. Then for planar switched homogeneous systems, an LMI approach to stability of planar switched homogeneous systems is presented. Similar to the condition for linear systems, the LMI-type condition is easily verifiable. An example is given to illustrate that candidate common Lyapunov function is a key point for design of switching law.     

Waves in an Inhomogeneous Tube with a Flowing Two-Phase Fluid

Results of theoretical and mathematical justification of the problem on a pulsating flow of a two-phase barotropic bubbly fluid enclosed in an elastic semi-infinite cylindrical tube inhomogeneous along its length are presented. Linear one-dimensional equations are used. It is assumed that the tube is rigidly attached to the surrounding medium and therefore its displacement in the axial direction is absent. At infinity, the tube material is assumed to be homogeneous. To describe the pressure, flow rate, and displacement of the fluid, a pulsating pressure is given at the tube end. The problem stated is reduced to a singular Sturm-Liouville boundary-value problem, which in turn is reduced to a Volterra-type integral equation. This equation is solved by the method of successive approximations. By assuming that the corresponding potential is integrable, it is proved that these approximations converge to the exact solution of the problem. It is shown that this assumption also covers the very important practical case of piecewise inhomogeneity. For numerical realization, we consider a homogeneous tube with flowing water containing a small amount of bubbles. The effect of the volume content of bubbles on wave characteristics is revealed. In particular, it is stated that, for the oscillation regime selected, an increased bubble volume content decreases the wave velocity and considerably increases the flow speed (rate).     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

不确定条件下双目标组批生产的交货期设置研究

交货期是调度方法的函数,因而具有不确定性.研究变批量、变批次、变生产能力下,单阶段、双目标有条件相容组批的交货期设置问题,将它转化为订单投放策略和调度模式研究.建立了一个基于目标的双目标订单投放策略数学模型.采用目标序列优先方法进行双目标求解,用两种调度模式求出区间值,进行最优交货期逼近.模式1:松弛掉产品加工约束条件,基于负荷考虑、给出离散生产模式下订单完工率最大的订单排序算法,算法综合考虑了任务紧急程度、可调度性、重要度和流程时间最短四个方面,得到区间的一个端点.模式2是有条件相容的启发式组批调度算法,即通过聚类计算将订单安排问题转化为多队列调度问题,将新来订单的投放转化为某个队列的插单和批量分割问题,不同队列中批的投产顺序由批中优先级最高的订单决定,并在能力约束下进行批量分割计算,得到区间的另一个端点,结合流程可靠性求出区间.实例证明,模式2的交货期设置小,订单完工率和生产率高.