海战场态势评估问题的研究

对海战场综合态势进行态势评估和威胁分析是信息融合系统的最高层级,态势评估结果将对指挥员的指挥决策起到非常重要的作用。根据海军作战理论分析了海战场态势的表示方法,并基于模板方法设计了一种战场当前态势与模板数据库中态势进行匹配的算法。该算法特别适用于高层推理如态势或威胁评估。     

Economic design of X¯ control charts for two manufacturing process models

Control charts are widely used for process surveillance. The design of a control chart refers to the choice of sample size, the width of the control limits, and the interval between samples. Economic designs have been widely investigated and shown to be an effective method of determining control chart parameters. This article describes two different manufacturing process models to which the X¯ control chart is applied: The first model assumes that the process continues in operation while searches for the assignable cause are made, and the second assumes that the process must be shut down during the search. Economic models of the control chart for these two manufacturing process models are developed, and the sensitivity of the control chart parameters to the choice of model is explored. It is shown that the choice of the proper manufacturing process model is critical because selection of an inappropriate process model may result in significant economic penalties.     

Minimal forecast horizon procedures for dynamic lot size models

This article presents new results which should be useful in finding production decisions while solving the dynamic lot sizing problem of Wagner–Whitin on a rolling horizon basis. In a rolling horizon environment, managers obtain decisions for the first period (or the first few periods) by looking at the forecasts for several periods. This article develops procedures to find optimal decisions for any specified number of initial periods (called planning horizon in the article) by using the forecast data for the minimum possible number of future periods. Computational results comparing these procedures with the other procedures reported in the literature are very encouraging.     

On the isbell and marlow fire programming problem

A complete solution is derived to the Isbell and Marlow fire programming problem. The original work of Isbell and Marlow has been extended by determining the regions of the initial state space from which optimal paths lead to each of the terminal states of combat. The solution process has involved determining the domain of controllability for each of the terminal states of combat and the determination of dispersal surfaces. This solution process suggests a solution procedure applicable to a wider class of tactical allocation problems, terminal control attrition differential games. The structure of optimal target engagement policies in “fights to the finish” is discussed.     

The discrete max-min problem

The historic max-min problem is examined as a discrete process rather than in its more usual continuous mode. Since the practical application of the max-min model usually involves discrete objects such as ballistic missiles, the discrete formulation of the problem seems quite appropriate. This paper uses an illegal modification to the dynamic programming process to obtain an upper bound to the max-min value. Then a second but legal application of dynamic programming to the minimization part of the problem for a fixed maximizing vector will give a lower bound to the max-min value. Concepts of optimal stopping rules may be applied to indicate when sufficiently near optimal solutions have been obtained.     

A maximum utility solution to a vehicle constrained tanker scheduling problem

A modification to the Dantzig and Fulkerson Tanker Scheduling Problem is described. An insufficient number of vehicles and a utility associated with each vehicle delivery are assumed. The new problem is shown to be equivalent to a Transshipment Problem, the solution of which is the same as the maximal utility solution of the modified Tanker Scheduling Problem. An example is given.     

Simulations to explore alternative sequencing rules

A flexible simulation system has been designed to permit investigation of sequencing rules in a large job shop, with continual input of new work. The objective is to understand what happens rather than to find optimum rules, with many conflicting measures of effectiveness: work in process, finished goods investment, delays, machine and labor utilization, and effort to implement. A few problem areas have been explored.     

Suboptimal algorithms for the quadratic assignment problem

The idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors.     

An operator theory of parametric programming for the transportation problem-II

This paper investigates the effect on the optimum solution of a (capacitated) transportation problem when the data of the problem (the rim conditions-i. e., the warehouse supplies and market demands-, the per unit transportation costs and the upper bounds) are continuously varied as a (linear) function of a single parameter. Operators that effect the transformation of optimum solution associated with such data changes, are shown to be a product of basis preserving operators (described in the earlier paper) that operate on a sequence of adjacent basis structures. Algorithms are provided for both rim and cost operators. The paper concludes with a discussion of the economic and managerial interpretations of the operators.