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     

灰色可靠性设计模型及其在机械工程应用

将灰色系统推广到概率统计理论 ,阐述了灰色概率公理化体系 ,研究了灰色概率密度函数与灰色可靠度计算方法 ,建立了应力—强度干涉灰色可靠度计算模型及其白化求解方法 ,编制了matlab5 3语言程序。给出了工程应用实例 ,并对结果与常规可靠性设计进行了对比分析 ,显示了本模型的正确性与可行性。它可用于设计参数变动对可靠度的灵敏度分析及其稳健性可靠性设计 ,有效地控制设计参数     

燃气轮机仿真软件构造方法综述

从方法论的角度综述了燃气轮机仿真软件的研究现状,分析了过程式方法和过程式模块化方法的不足,阐明采用面向对象方法的必要性,并对未来的发展方向作了初步探讨.     

信息战建模的分析与探讨

通过对信息战建模的分析与总结,指出了一个完善的信息战建模方法应具备的基本功能;给出了这种建模方法的结构流图,并分析了结构流图的构成.该方法建立的信息战模型,能有效地识别信息战的效果,对信息战的理论发展和具体实施都有较重要的指导作用.     

正弦波型直流无刷电动机位置伺服系统的变结构控制

在分析正弦波型直流无刷电动机数学模型的基础上,采用比例等速变速控制策略(PCV)设计控制器,应用于正弦波型直流无刷电动机位置伺服系统.仿真结果表明:与传统PI控制器比较,PCV控制策略可以明显改善系统的品质,并增强系统的鲁棒性.     

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     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

用毁伤概率指标优化二点源诱饵系统布阵

两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。     

基于冗余的复杂体系动态适应性结构设计研究

针对复杂体系动态适应性研究所存在的问题,提出了复杂体系冗余概念和基于冗余的复杂体系动态适应性结构设计思想,讨论了基于冗余的复杂体系动态博弈设计过程及体系结构;在此基础上,根据复杂体系使命目标的执行特点及体系本身的结构特性,详细地阐述了复杂体系中的任务冗余、系统冗余和结构冗余三种冗余类型,并从冗余切换方式、冗余具体内容和冗余表现性质三个方面论述了复杂体系中各种冗余所组成的冗余体系,指出冗余体系是复杂体系适应环境的一种策略,也是复杂体系不断演化的需要和结果,并且能够为复杂体系动态适应性结构的构建及其效能评估和复杂体系的优化及改进等研究提供一定的理论指导。