防空导弹武器中末制导交班灵敏度分析

复杂战场环境下,中远程防空导弹武器的中末制导交班问题越来越突出。实战要素影响到武器系统的各个环节,尤其是传感器测量精度,从而影响中末制导交班概率。通过灵敏度分析方法,对实战条件下影响中末制导交班的关键因素进行了分析,筛选出了高敏感影响因素,并得到了表征其影响程度的定量化灵敏度系数。     

Stein–Chen approximation and error bounds for order fill rates in assemble‐to‐order systems

Assemble‐to‐order (ATO) is an important operational strategy for manufacturing firms to achieve quick response to customer orders while keeping low finished good inventories. This strategy has been successfully used not only by manufacturers (e.g., Dell, IBM) but also by retailers (e.g., Amazon.com). The evaluation of order‐based performance is known to be an important but difficult task, and the existing literature has been mainly focused on stochastic comparison to obtain performance bounds. In this article, we develop an extremely simple Stein–Chen approximation as well as its error‐bound for order‐based fill rate for a multiproduct multicomponent ATO system with random leadtimes to replenish components. This approximation gives an expression for order‐based fill rate in terms of component‐based fill rates. The approximation has the property that the higher the component replenishment leadtime variability, the smaller the error bound. The result allows an operations manager to analyze the improvement in order‐based fill rates when the base‐stock level for any component changes. Numerical studies demonstrate that the approximation performs well, especially when the demand processes of different components are highly correlated; when the components have high base‐stock levels; or when the component replenishment leadtimes have high variability. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

高可靠性软件的极值统计分析

提出了极值统计分析的方法.对于失效数据极值分布函数的拟合检验,采用了相关系数法;对于母体分布的参数估计,则分别采用了最小二乘估计(LSE)和极大似然估计(MLE);最后通过一个实例说明了统计过程,并用模拟的方法证明了最小二乘估计较好.     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Modeling multiple stage manufacturing systems with generalized costs and capacity issues

This study introduces one modeling methodology that describes a broad range of multiple stage production planning issues, including multiple limited resources with setup times and joint fixed cost relationships. An existing production system is modeled in this fashion, creating a new set of 1350 highly generalized benchmark problems. A computational study is conducted with the 1350 benchmark problems introduced in this paper and 2100 benchmark problems, with more restrictive assumptions, from the existing literature. The relative merits of a decomposition‐based algorithm and a neighborhood search technique known as NIPPA, or the Non‐sequential Incremental Part Period Algorithm, are assessed. NIPPA is generally the more successful of the two techniques, although there are specific instances in which the decomposition‐based algorithm displayed a distinct advantage. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A note on the optimality of index priority rules for search and sequencing problems

We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Optimal control of a capacitated inventory system with multiple demand classes

This article studies the optimal control of a periodic‐review make‐to‐stock system with limited production capacity and multiple demand classes. In this system, a single product is produced to fulfill several classes of demands. The manager has to make the production and inventory allocation decisions. His objective is to minimize the expected total discounted cost. The production decision is made at the beginning of each period and determines the amount of products to be produced. The inventory allocation decision is made after receiving the random demands and determines the amount of demands to be satisfied. A modified base stock policy is shown to be optimal for production, and a multi‐level rationing policy is shown to be optimal for inventory allocation. Then a heuristic algorithm is proposed to approximate the optimal policy. The numerical studies show that the heuristic algorithm is very effective. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 43–58, 2011     

从《孙子兵法》管理思想看密切官兵关系的重要性

《孙子兵法》作为兵学圣典,对当前部队的日常管理具有重要的指导作用。从《孙子兵法》对自古以来官兵紧张关系的具体描述,剖析当前官兵关系紧张的成因,探讨科学解决官兵紧张关系的方法。