Applying Lanchester's linear law to model the Ardennes campaign

In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001     

基于AHP和模糊数学的课程评估系统初探

给出课程评估的因素和指标体系,提出模糊数学与AHP相结合进行课程综合评价的原理与方法,使对问题的定性分析与定量分析得到有机结合,评估结果科学合理.     

基于工控机的导弹指令系数测量方法

指令系数是防空导弹测试中比较重要的参数之一 ,通过对指令系数计算方法的分析 ,得出舵控信号起始采样时刻不会影响测量结果的结论 ,从而大大简化了测量系统的硬件结构和数据采集过程 ,提高了测量系统的稳定性 ,经过较长时间的应用表明 ,测量结果稳定性高 ,一致性好。     

General multiprocessor task scheduling

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one‐job‐on‐one‐machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job, we study the problem with a one‐job‐on‐multiple‐machine model. In our model, there are several alternatives that can be used to process a job. In each alternative, several machines need to process simultaneously the job assigned. Our purpose is to select an alternative for each job and then to schedule jobs to minimize the completion time of all jobs. In this paper, we provide a pseudopolynomial algorithm to solve optimally the two‐machine problem, and a combination of a fully polynomial scheme and a heuristic to solve the three‐machine problem. We then extend the results to a general m‐machine problem. Our algorithms also provide an effective lower bounding scheme which lays the foundation for solving optimally the general m‐machine problem. Furthermore, our algorithms can also be applied to solve a special case of the three‐machine problem in pseudopolynomial time. Both pseudopolynomial algorithms (for two‐machine and three‐machine problems) are much more efficient than those in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 57–74, 1999     

一种循环队列的判定定理

首尾相接的循环队列是一种动态的数据结构。本文给出了在并发进程环境下,使用循环队列的判定定理,本定理已在银河机软件实现中得到应用。     

Scheduling jobs and maintenance activities on parallel machines

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machines where each machine must be maintained once during the planning horizon. Our objective is to schedule jobs and maintenance activities so that the total weighted completion time of jobs is minimized. Two cases are studied in this paper. In the first case, there are sufficient resources so that different machines can be maintained simultaneously if necessary. In the second case, only one machine can be maintained at any given time. In this paper, we first show that, even when all jobs have the same weight, both cases of the problem are NP-hard. We then propose branch and bound algorithms based on the column generation approach for solving both cases of the problem. Our algorithms are capable of optimally solving medium sized problems within a reasonable computational time. We note that the general problem where at most j machines, 1 ≤ j ≤ m, can be maintained simultaneously, can be solved similarly by the column generation approach proposed in this paper. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 145–165, 2000     

分布式虚拟环境中环境信息动态更新研究

环境信息动态更新是分布式虚拟环境的一个主要特点,如何使环境信息更新更活跃、更反应实际情况,一直是分布式虚拟环境研究的重点。在典型的分布式交互环境中,环境信息动态更新是基于协议数据单元(PDU),它不提供数据可靠性传输保证。如何保证分布式环境中各结点环境信息一致性,本文提出了一种信息校验和协议,它通过极少的信息传输就可保证各结点环境信息高度一致。文中定义了保证分布式环境信息动态一致性更新的协议数据单元,并在试验环境中证明了协议的可靠性。     

The impact of exponential smoothing forecasts on the bullwhip effect

An important phenomenon often observed in supply chain management, known as the bullwhip effect, implies that demand variability increases as one moves up the supply chain, i.e., as one moves away from customer demand. In this paper we quantify this effect for simple, two‐stage, supply chains consisting of a single retailer and a single manufacturer. We demonstrate that the use of an exponential smoothing forecast by the retailer can cause the bullwhip effect and contrast these results with the increase in variability due to the use of a moving average forecast. We consider two types of demand processes, a correlated demand process and a demand process with a linear trend. We then discuss several important managerial insights that can be drawn from this research. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 269–286, 2000     

浅析失火罪与消防责任事故罪

本文通过介绍《重庆市办理失火罪和消防责任事故罪案件立案标准（暂行）》,简述了失火罪与消防责任事故罪的具体概念、主要构成特征及区别。     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.