Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Network design for time‐constrained delivery

To meet customer demand, delivery companies are offering an increasing number of time‐definite services. In this article, we examine the strategic design of delivery networks which can efficiently provide these services. Because of the high cost of direct connections, we focus on tree‐structured networks. As it may not be possible to identify a tree‐structured network that satisfies all of the delivery guarantees, we allow these guarantees to be violated but seek to minimize the sum of the violations. We establish the complexity of the problem and exploit an empirically identified solution structure to create new neighborhoods which improve solution values over more general neighborhood structures. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

To wait or not to wait: Optimal ordering under lead time uncertainty and forecast updating

There has been a dramatic increase over the past decade in the number of firms that source finished product from overseas. Although this has reduced procurement costs, it has increased supply risk; procurement lead times are longer and are often unreliable. In deciding when and how much to order, firms must consider the lead time risk and the demand risk, i.e., the accuracy of their demand forecast. To improve the accuracy of its demand forecast, a firm may update its forecast as the selling season approaches. In this article we consider both forecast updating and lead time uncertainty. We characterize the firm's optimal procurement policy, and we prove that, with multiplicative forecast revisions, the firm's optimal procurement time is independent of the demand forecast evolution but that the optimal procurement quantity is not. This leads to a number of important managerial insights into the firm's planning process. We show that the firm becomes less sensitive to lead time variability as the forecast updating process becomes more efficient. Interestingly, a forecast‐updating firm might procure earlier than a firm with no forecast updating. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

防空武器系统仿真中的三维图形实时成像技术

图形图像技术在仿真中的应用除使之高度可视化外,更重要的是引入了“三维描述”的概念,扩大了“定量”     

坚持理论创新是中国共产党永葆生机的源泉

创新是一个政党永葆生机的源泉.一部马克思主义理论发展史,就是一部理论创新史.中国共产党是一个善于进行理论思考和理论创新的政党 .80年来,我们党坚持把马克思主义的基本理论同中国的具体实际相结合,在继承中创新,在创新中发展,与时俱进,提出了一系列时代色彩鲜明的新的理论观点.     

STCN的对岸打击时间协同冲突消解研究

为验证航空兵对岸打击中时间协同计划的可行性以及快速地调整时间协同计划,建立了任务间的简单时间约束网络(STCN),并转化成权值矩阵的形式.根据权值矩阵特点,提出了一种检测STCN一致性的权值矩阵法,大大降低了算法复杂度.为加快时间协同计划的调整速度,基于检测结果,提出了一种代价最小的冲突消解方法,避免了消解过程中的重复检测问题,提高了效率,使计划调整更加快捷高效.     

对数正态分布的维修时间均值检验方法

针对许多装备维修时间服从或近似服从对数正态分布,从对数方差已知或未知两种角度,在控制单方或双方风险的基础上,提出了维修时间均值的检验方法,并通过实例验证了检验方法的实用性。     

基于反射内存网的复合导引头联合仿真试验设计

联合仿真试验同时具备实装试验、数学仿真试验和半实物仿真试验的优点,可构建全面逼真的试验环境,其中实时算法和通信技术是关键技术。基于反射内存网技术,进行了复合导引头联合仿真试验总体方案设计,对试验中的时间同步、数据同步等关键问题进行了研究,解决了联合仿真试验中各仿真系统协同及实时通信问题,对联合仿真试验的开展有一定的应用价值。     

大型消防装备采购模式及全寿命期费用控制问题探析

大型消防装备采购模式存在的一些问题,影响了大型消防装备全寿命期的经费使用效益,导致大型消防装备的购置费用高而效率低,装备闲置和利用率不高,装备全寿命期费用控制效果较差,必须建立大型消防装备全寿命费用管理体系,提高大型消防装备投资的效率。