Scheduling of depalletizing and truck loading operations in a food distribution system

This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP‐hard. Then we propose polynomial‐time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

Threshold optimization for weighted voting classifiers

Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003.     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

武器控制系统战斗有效性分析

分析了武器控制系统对机载武器系统战斗有效性的影响因素,定量描述了各影响因素,给出了影响战斗有效性程度的指数,并研究了其计算的方法。根据计算结果,得到了战斗有效性的损失变化范围,这一变化范围可作为评价武器控制系统优劣的重要依据,最后给出了具体算例和说明。     

舰炮火控系统反应时间与精度关系的仿真

对舰炮火控系统中反应时间和系统精度之间的关系做了简要的介绍,并论述了舰炮火控系统中时间和精度之间复杂的关系,通过分析采样点数和误差之间的关系,结合采样点数和系统反应时间之间的联系以及误差与系统精度之间的联系,引出反应时间与精度之间的某种关系,最后对从接收目标指示到给出射击诸元这个过程的各个时间段与其相对应的精度之间的关系进行计算机仿真。     

数字化部队指挥网络系统效能评价模型

以结构熵理论为基础,分析数字化部队作战指挥信息网络系统组织结构对系统内信息流的影响,从信息的角度对系统组织结构的有序度进行评价,引入信息流的时效和质量的概念,建立定量评价系统结构有序度计算的时效质量模型,结合系统数据传输业务效能的评价方法,形成作战指挥信息网络系统整体综合效能的评价模型。最后辅以实例。     

红外导弹制导系统的半实物仿真系统设计

对导弹系统的核心部件——制导系统进行半实物仿真是导弹系统研制中最经济和有效的手段之一。论述了红外制导系统半实物仿真系统的功用,给出了其原理框图,对其中几个关键技术:运动学方程特性的仿真建模、目标背景与对抗特性的生成技术、计算机软件和接口技术、校准设备与故障检测等的实现进行了深入地分析,并介绍了其具体的设计方案。     

C4ISR系统层次化建模方法

建模仿真是对C4ISR系统进行分析设计的重要手段。针对C4ISR系统的特点,提出了一种层次化建模的方法,对系统的多层抽象、模型的形式化描述和模型组合等问题进行了研究,最后给出了一个简单的示例。     

C3I系统中的态势关联技术

态势关联是在态势估计前必须解决的一个问题,即要将不同时刻的态势数据进行关联,得到各个时刻态势数据中描述的目标间的关系。对时间间隔比较长的态势数据的关联,研究了一种基于模糊推理的态势关联方法,综合考虑了目标属性信息和状态信息、战场环境信息、指挥人员的态势预估计知识,通过推理得到关联的结果。