便携式自寻的反坦克导弹攻顶弹道研究

便携式反坦克导弹在通过击顶方式打击目标时,要同时满足落角和精度的要求,以达到对目标的毁伤效能。首先推导带落角约束的最优比例导引律;然后设计携式反坦克导弹击顶弹道方案,导弹先出筒无控,以指数规律完成爬升,采用定攻角进行滑翔飞行,弹道末端运用推导的导引律来满足对落点和落角的约束。仿真结果表明,当反坦克导弹攻击不同距离的目标时,该弹道方案具有较强的有效性。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

Realignment in the National Football League: Did they do it right?

The National Football League (NFL) in the United States expanded to 32 teams in 2002 with the addition of a team in Houston. At that point, the league was realigned into eight divisions, each containing four teams. We describe a branch‐and‐cut algorithm for minimizing the sum of intradivisional travel distances. We consider first the case where any team can be assigned to any division. We also consider imposing restrictions, such as aligning the AFC (American Football Conference) and the NFC (National Football Conference) separately or maintaining traditional rivalries. We show that the alignment chosen by the NFL does not minimize the sum of intradivisional travel distances, but that it is close to optimal for an alignment that aligns the NFC and AFC separately and imposes some additional restrictions. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 683–701, 2003.     

飞机结构疲劳可靠度贝叶斯组合预测

在实际工程中,常常需要利用模型去描述和分析问题。然而模型亦存在不确定性,即可能存在多个描述同一现象的模型,例如多个疲劳分析的模型。针对飞机结构的疲劳可靠性问题,提出在考虑三种裂纹扩展模型下基于贝叶斯公式的疲劳可靠度组合预测方法。针对不同应力水平下飞机结构试件的裂纹扩展数据建立了三种随机裂纹扩展模型;在考虑模型参数不确定性条件下,采用贝叶斯模型平均方法对三种模型进行组合;基于组合模型分析结构的可靠度。所提方法在分析飞机结构疲劳可靠度上,采用了组合模型,能够最大限度保障结果的稳定性。此外,考虑了模型参数的不确定性,能够得到更为合理的裂纹扩展预测分布和可靠度预测值。给出的实例及分析结果表明所提方法可行。     

Potential impact of recharging plug‐in hybrid electric vehicles on locational marginal prices

Plug‐in hybrid electric vehicles (PHEVs), upon market penetration, will create additional recharging loads to the electric power systems. This article considers different recharging scenarios and uses game theoretic models to study the potential impact of the recharging loads on locational marginal prices (wholesale electricity prices). Computational results from a Pennsylvania‐New Jersey‐Maryland Interconnection case study show that, under the existing recharging infrastructures, even a small magnitude of load increase caused by PHEV recharging could have a significant undesirable impact on locational marginal prices. The impact could be mitigated to a varying extent by the availability of possible future recharging infrastructures, including realtime pricing recharging meters, battery stations, or vehicle‐to‐grid technology.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Decomposing inventory routing problems with approximate value functions

We present a time decomposition for inventory routing problems. The methodology is based on valuing inventory with a concave piecewise linear function and then combining solutions to single‐period subproblems using dynamic programming techniques. Computational experiments show that the resulting value function accurately captures the inventory's value, and solving the multiperiod problem as a sequence of single‐period subproblems drastically decreases computational time without sacrificing solution quality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

灰色预测模型在非致命武器经济寿命预测中的应用

针对目前非致命武器经济寿命方面的研究相当缺乏的现状,结合非致命武器的自身特点,在全面分析装备全寿命周期费用的基础上,引入灰色理论,运用GM（1,1）模型对非致命武器的经济寿命周期费用进行估算和预测。通过分析,灰色预测模型具有较高的建模精度,预测方法和结果对非致命武器的经济寿命预测具有很强的实用性。     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009