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     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

Kurtosis correction method for X̄ and R control charts for long‐tailed symmetrical distributions

This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

动基站时差探测系统定位方法研究

针对传统长基线时差探测系统的缺点,提出了全新的动基站时差测量系统并给出了目标的定位原理。在典型布站、信息存在冗余的前提下,通过子集选优法确定了最佳定位算法,并根据工程应用的需要确定了更加合理简捷的定位算法,统计仿真表明了该算法的有效性。最后,计算了目标高度测量精度并归纳了其特点,给出了有益的结论。     

基于Monte Carlo法的地空导弹火力分配优化问题研究

在确定地空导弹对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合Monte Carlo法的基本原理,介绍了解决地空导弹火力分配优化问题的一般步骤。运用计算机模拟技术,通过算例,证明了该方法的可行性,为有效解决地空导弹火力分配优化问题提供了一种较为科学的方法。     

落球法测定液体粘滞系数实验的改进

针对测定液体粘滞系数实验中所存在的问题,对小球下落时间的测量方法提出了改进,以提高实验精度,减小实验误差。     

军校开展案例教学之我见

案例教学作为一种行之有效的教学方法,有助于锻炼和提高军队院校学员分析问题、解决问题的能力,军校应正确认识案例教学的重要意义,深入探讨如何选编案例以及实施案例教学的具体措施。     

基于CEC系统舰艇编队防空作战最小共享信息集研究

根据最小共享信息集的概念,提出了基于CEC系统舰艇编队协同防空作战的智能系统模型,分析了舰艇编队CEC系统的作战功能和作战信息,提出了确定舰艇编队协同防空作战的最小共享信息集的事件法,并应用信息论证明了事件法的确能够减少通信的信息量。在上述基础上,确定了舰艇编队协同防空作战的最小共享信息集。     

基于改进局部投影算法的非线性时间序列降噪

改进了非线性时间序列降噪的局部投影算法,并应用此算法对含噪Lorenz混沌信号进行降噪,将其与小波分析降噪效果进行比较,实验结果表明:改进的局部投影算法对非线性信号降噪效果十分明显。