设备的一种计划维修策略

本文根据设备在全寿命内有事后修理、计划修理和最后报废的实际情况,以全寿命内单位时间的更新维修期望费用最少为目标函数,建立一种数学模型,寻求设备在全寿命内最佳计划修理次数N和最佳的一组计划维修时间间隔集T。     

开放式CAD图形库的建造与管理

针对目前大多数CAD系统中图形库存在的通用性差、开发效率低、可维护性和可移植性差等方面的问题,提出建造和管理开放式CAD图形库的方法。按此法建造的CAD图形库可相对整个CAD系统独立,对各级用户具有良好的透明度,便于进行二次开发,便于维护和扩充,从而提高设计效率。     

某型舰炮低压电气系统故障诊断专家系统知识库的建立

本文利用故障树分析法,通过认真分析某型舰炮低压电气系统的原理和结构特点,建立了用于诊断的故障树,并在此基础上,建立了系统知识库。     

异常市场的判别

给出了股票价格的Black Scholes模型中股票期望收益率μ及波动率σ2的估计,并证明了这种估计的良好性质。给出异常市场判别准则,提出第一、第二警戒值的计算公式。     

基于灰色时序的完整性规范技术

计算机系统的完整性安全策略模型与规范问题，是计算机安全研究中最重要的课题之一。已有的研究结果离实际应用还相差太远，例如Ｃｌａｒｋ－Ｗｉｌｓｏｎ完整性模型只是提出了一个框架。本文呈现了我们构造的形式化灰色时序安全策略规范语言（ＧＴＳＬ）。ＧＴＳＬ的理论基础是灰色系统理论和时序规范语言ＬＯ－ＴＯＳ理论。由于它在完整性规范能力、完整性验证过程的构造与表示、责任分离合理性测试等一系列技术方面的完善与创新，使得ＧＴＳＬ成为真正能够实际使用的完整性安全策略规范语言。     

基于关系数据库的仿真模型管理

本文将讨论仿真模型库管理技术。从仿真模型库管理的实际需求出发，提出以关系代数系统实体结构（ＲＡＳＥＳ）框架为理论依据、利用关系数据库进行模型库管理的方法，并给出模型库管理算法的形式化描述及系统设计。     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

Optimal allocation of minimal repairs in parallel and series systems

In reliability engineering, the concept of minimal repair describes that the repair brings the failed unit (eg, system or component) to the situation which is same as it was just before the failure. With the help of the well‐known Gamma‐Poisson relationship, this paper investigates optimal allocation strategies of minimal repairs for parallel and series systems through implementing stochastic comparisons of various allocation policies in terms of the hazard rate, the reversed hazard rate, and the likelihood ratio orderings. Numerical examples are presented to illustrate these findings as well. These results not only strengthen and generalize some known ones in the seminal work of Shaked and Shanthikumar, but also solve the open problems proposed by Chahkandi et al.'s study and Arriaza et al.'s study.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.