A balancing problem for mixed model assembly lines with a paced moving conveyor

We state a balancing problem for mixed model assembly lines with a paced moving conveyor as: Given the daily assembling sequence of the models, the tasks of each model, the precedence relations among the tasks, and the operations parameters of the assembly line, assign the tasks of the models to the workstations so as to minimize the total overload time. Several characteristics of the problem are investigated. A line‐balancing heuristic is proposed based on a lower bound of the total overload time. A practical procedure is provided for estimating the deviation of any given line‐balance solution from the theoretical optimum. Numerical examples are given to illustrate the methodology. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于模糊理论的武器系统可靠性分析和评价

武器系统可靠性是指在规定条件下和规定时间内完成规定功能的能力。传统的可靠性计算方法是基于概率论的,其失效概率通常应根据第一手的数据。然而,实际上不可能收集到足够的数据,一般是依靠专家的经验来判断估计,这类判断通常与模糊性密切相关。本文基于可靠性理论和模糊数学的原则和方法,建立了一套计算串联系统和并联系统的模糊可靠度的计算公式。应用模糊数对武器装备系统单元可靠性予以模糊评价,并采用模糊可靠性计算模型,对武器系统可靠性进行模糊分析和计算。通过对一高炮武器系统的应用分析,证明了该方法的可行性。     

单兵系统数据模型

讨论了单兵系统的体系结构和信息要素,并结合单兵系统在联合作战中的应用例子,对其业务过程和信息流进行初步分析。然后通过IDEF1X方法,设计单兵系统基于关系数据库的数据模型。最后讨论了模型的规范化问题,并给出检验数据模型的方法。     

一次性化学电池动态输出特性光电耦合测量法

提出了装备用一次性化学电池动态输出特性的光电耦合测量法。该方法采用独立电源供电,工作安全可靠,系统标定和数据采集、处理及结果输出等均由计算机控制完成,具有良好的操作环境,并且可在电动高旋机上使用,也可以用于对各种电压信号远距离遥测。     

A two product dynamic economic lot size production model with either-or production constraints

This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.     

Stochastic duels involving reliability

The reliability of weapons in combat has been treated by Bhashyam in the context of a stochastic duel characterized by fixed ammunition supplies. negative exponentially distributed firing times and weapon lifetimes, and a fixed number of spare weapons for each duelist. The present paper takes a different approach by starting with the fundamental duel of Ancker and Williams, characterized by unlimited ammunition and by ordinary renewal firing times, and adding to it weapon lifetimes which can be functions of time or of round position in the firing sequence. Probabilities of winning and tieing are derived and it is shown that under certain conditions the weapon lifetimes are equivalent to random time and ammunition limits.     

Deterministic inventory lot‐size models under inflation with shortages and deterioration for fluctuating demand

In this paper, we extend the inventory lot‐size models to allow for inflation and fluctuating demand (which is more general than constant, increasing, decreasing, and log‐concave demand patterns). We prove that the optimal replenishment schedule not only exists but is also unique. Furthermore, we show that the total cost associated with the inventory system is a convex function of the number of replenishments. Hence, the search for the optimal number of replenishments is simplified to finding a local minimum. Finally, several numerical examples are provided to illustrate the results. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 144–158, 2001     

BTT控制系统半实物仿真方案 设计及试验结果分析

BTT控制系统半实物仿真试验以BTT试验器为背景,配合BTT控制技术研究可全面验证导弹控制系统设计。给出了半实物仿真试验方案、方法及试验结果分析,试验结果表明BTT控制系统设计满足最小侧滑(近似零侧滑角)倾斜转弯的技术指标要求,半实物仿真试验方法正确。