时延分布式控制系统的Truetime仿真分析

针对航空发动机分布式控制系统的时延问题,应用Matlab的Truetime工具箱,设计了控制系统仿真分析平台,分析了时延对系统稳定性的影响。首先针对一类应用状态反馈的控制系统,分析了存在传感器到控制器单侧时延的情况下,系统保持稳定的充分条件。在此基础上,以某型航空发动机为例,基于Truetime工具箱设计了分布式控制仿真系统,分析了不同的时延条件对系统稳定性的影响。仿真结果与理论分析结果一致,证明了系统的有效性。     

直接力/气动力复合控制系统的有限时间镇定

考虑到复合控制系统中,直接力的离散特性会使系统的设计复杂化。针对采用姿控式直/气复合控制的导弹,基于有限时间稳定理论,引入辅助滑模面,研究其控制系统的有限时间镇定,得到一个受控良好的复合控制系统。在此基础上,利用辅助模糊控制,对系统不确定性进行估计,进一步改善了复合系统的控制品质。最后以俯仰通道为例,对所提出的方法进行仿真,结果验证了该方法的有效性。     

基于配置管理的软件维护性评估

对软件质量进行定量化管理是软件工程领域的趋势,也是软件质量保证的重要手段。针对软件维护性定量评估难、数据获取难的问题,分析了软件维护性受配置管理关键要素的影响,提出利用配置管理数据对软件维护性间接评估的方法。结合软件工程开发实际,建立了配置管理数据收集过程,利用维护时间作为参数,统计5类功能点维护时间对软件维护性进行度量,实现了软件维护性的定量评估,并利用实际项目对方法的可行性和有效性进行了验证。     

内可逆闭式中冷回热布雷顿循环功率效率特性

应用有限时间热力学的方法分析了恒温热源条件下内可逆闭式中冷回热布雷顿循环的无因次功率和效率特性,导出了无因次功率及效率的解析式,通过数值计算,得到了分别对应于循环功率和效率的最佳中间压比分配,并研究了中冷度、回热度以及高低温侧换热器有致度对循环性能的影响。     

离散变结构控制理论研究现状与展望

对离散变结构控制理论的研究进展进行综述,总结了3种主要的DVSC方案,讨论了这一领域中存在的重要问题,并指出了该理论未来可能的研究方向.     

A branch‐and‐price algorithm for parallel machine scheduling with time windows and job priorities

This paper presents a branch‐and‐price algorithm for scheduling n jobs on m nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of ρ priority classes and may require two operations. The objective is to maximize the weighted number of jobs scheduled, where a job in a higher priority class has “infinitely” more weight or value than a job in a lower priority class. The methodology makes use of a greedy randomized adaptive search procedure (GRASP) to find feasible solutions during implicit enumeration and a two‐cycle elimination heuristic when solving the pricing subproblems. Extensive computational results are presented based on data from an application involving the use of communications relay satellites. Many 100‐job instances that were believed to be beyond the capability of exact methods, were solved within minutes. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

Designing a degradation experiment

Degradation experiments are widely used to assess the reliability of highly reliable products which are not likely to fail under the traditional life tests. In order to conduct a degradation experiment efficiently, several factors, such as the inspection frequency, the sample size, and the termination time, need to be considered carefully. These factors not only affect the experimental cost, but also affect the precision of the estimate of a product's lifetime. In this paper, we deal with the optimal design of a degradation experiment. Under the constraint that the total experimental cost does not exceed a predetermined budget, the optimal decision variables are solved by minimizing the variance of the estimated 100pth percentile of the lifetime distribution of the product. An example is provided to illustrate the proposed method. Finally, a simulation study is conducted to investigate the robustness of this proposed method. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 689–706, 1999     

广州市邮件业务量对确定运能需求的研究

为了合理利用车辆资源,为决策提供理论依据,本文采用多元统计回归分析法与模糊数学优化法,为广州市邮政局车辆运能研究,建立了数学模型,并附有项目软件,计算结果与实际情况吻合较好。这样,对合理利用邮政车辆资源,提高运营效率,具有一定的意义。     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998