Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

基于无线双工通信系统分组数据传输的探讨

分析了军用无线双工通信系统数据传输资源,指出了存在的问题及改进办法;利用话音、报文、传真、数据电路交换信令的工作模式标示,提出了基于无线双工通信系统的数据传输TCP/IP结构体系及协议栈,并探讨了网络适配和实现与军用公共数据网、地域通信网（电路交换网、分组交换网）、数字化部队单工无线电数据网互联的关键技术。     

小波神经网络在装备研制费预测与控制中的应用

通过小波及小波变换的原理和方法,建立了适用于武器装备研制费用的小波神经网络预测与控制模型.结合某型装备研制费用,进行了预测与控制的数据仿真.     

镍对重力分离SHS陶瓷内衬复合管的影响

采用SHS重力分离技术制备陶瓷内衬复合管,通过改变主燃烧配系组元Ni的含量,研究分析了金属Ni对陶瓷内衬复合管制备的燃烧特性及机械性能的影响。研究发现,适量的Ni粉能促进SHS燃烧进行,提高燃烧体系的绝热燃烧温度和陶瓷层的致密度,并且有助于形成金属/陶瓷界面过渡层,这极大提高了复合管的显微硬度和抗压剪强度。当Ni粉含量为19wt％时,陶瓷层的显微硬度和抗压剪强度分别最高达1764N/mm2和36.1MPa。     

质谱技术在火灾物证鉴定中的应用

随着火灾原因的多样化、复杂化,应用准确、高效的现代化仪器分析的方法鉴定火灾原因日益重要。简述了质谱相关技术,如气相色谱／质谱技术（GC／MS）,串联质谱技术（MS／MS）等在火灾物证鉴定中的应用。     

基于DSP+FPGA的导航计算机数据采集与处理硬件设计

根据捷联惯导系统中数据采集和运算处理的要求,提出了以高性能DSP为核心,由FPGA构成主要外部输入输出接口的导航计算机硬件设计方案;设计了I/F转换电路;给出了各电路的硬件结构框图和各器件的特性、选择与应用。从硬件方面分别讲述了FPGA和DSP的工作过程和功能。利用本方案,对实现军事和工程领域中导航系统微小型化、降低系统成本和体积具有重要意义。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

氘-金碰撞中J/ψ产生截面随x_F变化的研究

在不同碰撞质心能量下对氘-金(d-Au)碰撞中J/ψ核吸收效应进行了研究,结果表明,在不同碰撞质心能量下J/ψ核吸收截面随动量分数xF变化趋势明显不同。利用以上结论,计算了美国相对论重离子对撞机(RHIC)能量下J/ψ在氘-金(d-Au)碰撞中与质子-质子(p-p)碰撞中的产生截面比,并与实验数据比较发现,理论结果能很好的解释实验现象。最后,为欧洲大强子对撞机(LHC)实验作了理论预言,理论结果将为即将运行的LHC实验所检验。     

综合飞行/火力控制系统性能评价

详细介绍了综合飞行 /火力控制系统 (IFFCS)性能评价的方法。该方法把评价过程分为单元评价、组合评价和系统性能评价 ,将系统性能指标逐层分解 ,以保证闭合系统最终能完成自动攻击任务。以高性能控制系统仿真软件MATTRIXX6 .0为平台 ,按此方法开发的评价软件获得了用户的认可