迫击炮防重装装置研究

追击炮射击时可能会发生弹药重复装填,常常导致膛炸等严重事故,迫击炮防重装装置可有效防止该类事故发生。分析对比了光电式、电磁式、机械式3种技术方案的工作原理、技术特点,设计了一种安全可靠、能够适应各种复杂恶劣环境的机械式迫击炮防重装装置,详细介绍了其结构设计、工作原理和技术性能。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

Multiple common due dates

Common due date problems have been extensively discussed in the scheduling literature. Initially, these problems discussed finding a common due date for a set of jobs on a single machine. These single machine problems were later extended to finding the common due date on a set of parallel machines. This paper further extends the single machine problem to finding multiple common due dates on a single machine. For a basic and important class of penalty functions, we show that this problem is comparable to the parallel machine problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 293–298, 2001     

弹药长期贮存后发射药剩余能量的计算

对弹药在长期贮存过程中其发射药剩余能量的变化情况进行了研究。首先建立了箱装弹药中发射药放热规律的数学模型 ,然后利用数值模拟的方法计算了其在贮存过程中的剩余能量 ,最后对计算结果进行了分析与讨论     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

排序法在某类弹药寿命分析中的应用研究

将排序法应用于无失效弹药贮存寿命试验数据的统计分析 ,介绍了排序法的基本思想 ,并计算了某类弹药的平均贮存寿命置信下界。     

Multi‐item capacitated lot‐sizing problems with setup times and pricing decisions

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于战时弹药消耗及补给数据的弹药储备量控制方法

针对战时基于定点调拨的弹药储备与基于定期调拨的弹药储备中存在的断供与盲供问题,从弹药消耗及补给数据出发,围绕弹药消耗量、补给量与储备量之间的相互关系,以优化技术为手段,兼顾基于定点调拨弹药储备与基于定期调拨弹药储备的优点,通过寻求最佳弹药储备量和最佳弹药补给点的方法,实现了弹药储备量的优化控制,为今后的弹药储备控制方法研究提供了理论依据和参考。     

Production planning with resources subject to congestion

A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Deterministic chaos in a model of discrete manufacturing

A natural extension of the bucket brigade model of manufacturing is capable of chaotic behavior in which the product intercompletion times are, in effect, random, even though the model is completely deterministic. This is, we believe, the first proven instance of chaos in discrete manufacturing. Chaotic behavior represents a new challenge to the traditional tools of engineering management to reduce variability in production lines. Fortunately, if configured correctly, a bucket brigade assembly line can avoid such pathologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009