Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

An (s,q) inventory model with stochastic and interrelated lead times

In this article we introduce a lead time mechanism that allows simultaneous order arrivals. This mechanism ensures that orders never cross each other. For the continuous review (s, q) inventory system with constant demand, we show that the allowance of batch arrivals gives rise to a discontinuous cost function. By exploiting the special structure of this cost function, a search algorithm is derived that yields the optimal order strategy in a reasonable amount of time. The search is restricted to integer order strategies only. We also consider an approximate method of solution that is based on a related model with a continuous cost function. The results obtained by this approximation are, in general, very satisfactory. © 1995 John Wiley & Sons, Inc.     

爆电换能的理论分析

考虑了铁电介质的介电松弛和电导率松弛,计及冲击波阵面在样品中传播过程的影响,改进了垂直模式冲击波加载铁电陶瓷电响应的理论,且理论分析与实验结果基本一致。     

微波等离子体源分析与紧凑型氢等离子体枪设计

介绍和分析了几种等离子体微波器件中等离子体源,重点讨论了紧凑型氢等离子体枪的设计及其驱动电路。     

基于SHARC流水集束型多处理器板研制

结合某重点工程课题 ,设计和实现了基于 SHARC流水集束型多处理器板即研制出了具有 5个 SHARC的高速并行数字信号处理机。板上处理器数量可实现重配置以获得高的性价比。当板上前端 4个 SHARC用于 FFT时 ,研究和分析了板上前端 4个 SHARC用于 FFT时的三种不同缓冲数据模式下 FFT节点处理性能     

武器装备作战控制软件管理方法

随着科学技术不断进步 ,微处理器及其作战控制软件已被现代武器装备大量采用 ,作战控制软件发挥的作用越来越大 ,对软件的管理亦更加重要 ,通过对作战控制软件管理方面存在的问题的分析 ,提出了加强武器装备作战控制软件管理的方法     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999