Stock control in a many depot system

The chief problems considered are: (1) In a parallel set of warehouses, how should stocks be allocated? (2) In a system consisting of a central warehouse and several subsidiary warehouses, how much stock should be carried in each? The demands may have known, or unknown, distribution functions. For problem (1), the i-th stock n_i should usually be allocated in proportion to the i-th demand m_i; in special cases, a significant improvement is embodied in the formula (N = total allocable stock)

     

A multifaceted heuristic for the orienteering problem

The orienteering problem involves the selection of a path between an origin and a destination which maximizes total score subject to a time restriction. In previous work we presented an effective heuristic for this NP-hard problem that outperformed other heuristics from the literature. In this article we describe and test a significantly improved procedure. The new procedure is based on four concepts—center of gravity, randomness, subgravity, and learning. These concepts combine to yield a procedure which is much faster and which results in more nearly optimal solutions than previous procedures.     

Nonpreemptive scheduling of independent tasks with prespecified processor allocations

In this article we study the problem of scheduling independent tasks, each of which requires the simultaneous availability of a set of prespecified processors, with the objective of minimizing the maximum completion time. We propose a graph-theoretical approach and identify a class of polynomial instances, corresponding to comparability graphs. We show that the scheduling problem is polynomially equivalent to the problem of extending a graph to a comparability graph whose maximum weighted clique has minimum weight. Using this formulation we show that in some cases it is possible to decompose the problem according to the canonical decomposition of the graph. Finally, a general solution procedure is given that includes a branch-and-bound algorithm for the solution of subproblems which can be neither decomposed nor solved in polynomial time. Some examples and computational results are presented. © 1994 John Wiley & Sons, Inc.     

Nonadjacent extreme point methods for solving linear programs

In this article we present some advanced basis or block-pivoting, relaxation, and feasible direction methods for solving linear programming problems. Preliminary computational results appear to indicate that the former two types of simplex-based procedures may hold promise for solving linear programming problems, unlike the third type of scheme which is shown to be computationally unattractive.     

一类平面系统极限环的不存在性

在系统奇点唯一的条件下,研究了一类微分系统不存在极限环的的充分条件,运用和发展了以往的结果.     

时变环境下基于加速寿命试验的产品故障预测方法

针对传统可靠性模型及分析方法无法分析产品在时变环境下可靠性的缺陷,提出了时变环境应力下产品可靠性预测方法.引入比例风险模型描述产品可靠性与工作环境因素的关系,结合加速寿命试验数据,利用极大似然估计确定基准失效率函数及各环境因素协变量回归系数.在假设产品工作环境应力转换时间确定的情况下,建立了时变环境下可靠度分析模型.实例验证了该方法的有效性.     

Some distributions arising as a consequence of errors in inspection

In this article, the authors survey and consolidate their investigations during the years 1980-1983 dealing with consequences of errors in inspection sampling models. Some indication of the current and future research is given.