深亚微米条件下的多层VLSI／MCM层分配的遗传算法

本文提出了一个深亚微米条件下的多层ＶＬＳＭＣＭ有约束分层层分配的遗传算法。该算法分为两步：首先进行超层分配，使各线网满足Ｃｒｏｓｓｔａｌｋ约束，且超层数目最少；然后进行各超层的通孔最少化二分层。与目前的层分配算法相比，该遗传算法具有目标全面，全局优化能力强等特点，是一种可应用于深亚微米条件下的ＩＣ ＣＡＤ的有效分层方法。     

非线性系统鲁棒吸引的动态补偿方法

考虑非线性不确定系统的鲁棒吸引问题,借助于动态输出反馈,构造了两类控制律。这两类控制律分别可使相应的闭环系统被一任意小的区域鲁棒吸引,或被一预先设置的区域有限吸引。     

Design of pole-assignment controller for systems with algebraic-equation constraint

In this paper we have studied the control of linear systems with algebraic-equation constraint. A pole-assignment controller with two-layer structure for such constrained systems has been presented. The objective of the controller is to assign the desired poles to constrained system and simultaneously force the corresponding closed-loop system to satisfy the constraint. The conditions for the existence of pole-assignment controller are discussed in different cases. The implementation algorithm of pole-assignment controller is also presented. An example is given to illustrate the validity of the method in this paper.     

线性时变系统的区间稳定性与鲁棒稳定性

本文应用向量比较定理研究线性时变系统的区间稳定性和具非线性时变摄动的线性时变系统的鲁棒稳定性，所得的新结果包含文献的一些主要结果作为特例，本文的研究方法说明向量比较方法是分析区间稳定性和鲁棒稳定性的一种自然而有力的工具。     

Machine assignment and part-families formation using group technology

The conventional way of solving the group technology (GT) problem is to start from an assignment of parts to machines and try to find a partitioning of machine cells and part families. The similarity between parts is measured based on commonality of the machines assigned to them. However, parts are assigned to machines based on their operation requirements and the operation capabilities of machines. Similarity between parts should be based on their required operations. In this paper, the authors attempt to solve or facilitate solving the GT problem at the assignment level. An algorithm for assigning parts to machines is provided which utilizes the types of operations required by parts and applies GT principles in producing the assignment. This leads to better partitioning of machine cells and part-families. Furthermore, operation sequences required by parts in determining the similarity between parts have been considered. An algorithm to form part-families based on the operation sequence similarity coefficient has been developed. The resulting families are then used by the assignment algorithm to produce machine assignments to part-families. The use of the algorithm is demonstrated by examples.     

Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.     

有限缓冲区FMS的特征分析与托盘配置

本文研究了Ｊｏｂ－Ｓｈｏｐ型有限缓冲区ＦＭＳ的运行特性及托盘优化配置问题，给出了系统的分析模型及托盘优化算法。本文的结果对系统的分析与设计具有重要的实际意义。     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.     

多部件设备维修问题研究及遗传算法求解

合理组织设备维修，缩短设备维修时间是生产运营管理的一个重要环节。本文探讨了多部件设备维修的有效组织问题。考虑到维修工人对拆分后设备的不同部分具有不同的维修效率，提出了一种基于维修时间优化的决策方法，将其与经典指派方法进行了比较；进一步地，对这一NP-hard问题设计了遗传算法，通过数值例子讨论了其求解有效性。     

多粒度全光网中的多层联合路由

多粒度交换技术利用波带级路由以及光纤级路由,可有效降低光交叉连接器的复杂度.但多粒度交换增加了光网络的逻辑层次结构,使得网络中的路由与资源分配问题更为复杂,因此,在多粒度全光网中实现多层联合路由是提高网络性能的关键.本文对多粒度交叉连接结构进行了分析,并对多粒度全光网中的多层联合路由问题进行了研究.