Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A continuous‐time strategic capacity planning model

Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Excess capacity in weapons production: An empirical analysis∗ †

This paper analyzes a set of observations by the Congressional Budget Office (CBO) on individual weapons systems regarding whether large amounts of excess capacity exist and whether short run average cost (SRAC) appears to be severely decreasing. It is shown that the amount of excess capacity and steepness of SRAC are essentially independent of output rate. It is then argued that this suggests that production is occurring in inefficiently large plants—i.e.—off the long run cost curve.     

基于实战化条件下人民防空装备体系管理能力建设

基于实战化条件下人民防空装备体系管理能力建设应着眼国家安全利益拓展,人民防空转型建设需求和完成多样化任务需要,强化顶层设计,搞好储备,坚持信息主导,着眼＂能打仗、打胜仗＂,坚持＂战斗力这个唯一的根本的标准＂,建设与发展相适应的人民防空装备体系管理能力。     

增强科技素养，提高打赢能力

增强高级指挥员的科技认知力、创新力、运用力是科技强军的必然要求。本文从战争演变、融合发展、应对威胁切入,对高级指挥员如何提升科技认知力层次、增强科技创新力效能、提高科技运用力水平谈了几点初步思考。     

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     

军民融合产业内涵及范畴

发展军民融合产业是各级政府落实军民融合发展国家战略的重要抓手之一。针对军民融合产业界定不清等问题,从理论研究和实践工作层面梳理既有观点及演变趋势,形成对军民融合产业的客观认识。在此基础上,剖析军民融合产业的属性特征,从指导实践工作角度出发提出三种界定军民融合产业范畴及相关统计工作的合理化思路,并提出建立两级联动工作机制、开展国家工业基础中国防科研生产能力普查工作、试点开展军民融合产业分类标准及指标体系建设工作、加强军民融合产业统计数据质量监测等政策建议。     

Inventory management with advance capacity information

An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

一种多约束条件下高超声速导弹对地攻击的三维最优变结构制导律

针对高超声速空地导弹多约束高精度末制导的基本需求,在三维解耦的俯仰平面和转弯平面上分别设计制导律。在综合考虑脱靶量、落角、入射角等多种约束条件后,运用最优控制构造的最优制导律设计了一种三维最优变结构制导律,接着利用梯度自适应下降法和T-S模型改进了速度约束控制。最后通过典型弹道的结果显示该制导律能够满足多约束高精度制导的需要,具有良好的弹道性能。