基于CORBA事件服务的主动服务技术研究与实现

介绍了主动服务及其需求背景，文章讨论了基于 Ｃ Ｏ Ｒ Ｂ Ａ 事件服务实现主动服务的系统框架，并简要介绍了该在电信管理中，基于事件服务的主动服务的应用。     

链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

卫星任务调度问题的约束规划模型

卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。     

面向作战任务的最小风险传感器调度方法

基于风险理论提出一种面向不同目标探测任务的传感器调度方法。将主动传感器辐射被截获风险和目标探测风险结合起来,建立一般目标探测框架下的传感器最小风险调度模型。分目标跟踪、目标识别和目标威胁等级评估三种情况将传感器最小风险调度模型具体化,给出不同情况下目标探测风险值的计算方法。针对模型的求解提出一种基于混沌思想、反向学习和双向轮盘赌的改进人工蜂群算法。通过仿真实验证明了模型的可行性和算法的有效性。     

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.     

Oligopolistic contracting: Channel coordination under competition

We study contracts between a single retailer and multiple suppliers of two substitutable products, where suppliers have fixed capacities and present the retailer cost contracts for their supplies. After observing the contracts, the retailer decides how much capacity to purchase from each supplier, to maximize profits from the purchased capacity from the suppliers plus his possessed inventory (endowment). This is modeled as a noncooperative, nonzero‐sum game, where suppliers, or principals, move simultaneously as leaders and the retailer, the common agent, is the sole follower. We are interested in the form of the contracts in equilibrium, their effect on the total supply chain profit, and how the profit is split between the suppliers and the retailer. Under mild assumptions, we characterize the set of all equilibrium contracts and discuss all‐unit and marginal‐unit quantity discounts as special cases. We also show that the supply chain is coordinated in equilibrium with a unique profit split between the retailer and the suppliers. Each supplier's profit is equal to the marginal contribution of her capacity to supply chain profits in equilibrium. The retailer's profit is equal to the total revenue collected from the market minus the payments to the suppliers and the associated sales costs.     

轻量级SpaceFibre节点高速传输系统的优化设计

为满足卫星有效载荷间SpaceFibre链路的高带宽、高可靠性和轻量化的应用需求,提出一种SpaceFibre节点传输系统的优化设计。该设计采用基于帧累计的增量化计算方法减少了计算电路的冗余;通过四级流水架构满足了错误检测操作的时序要求,使用循环冗余校验共享机制平衡了硬件资源的使用;采取基于完整应答的双层控制策略提升了系统的可靠性,通过构建面向资源优化的控制状态机和存储架构简化了确认重传算法的实现逻辑。使用型号为XC7Z100FFG900-2的FPGA搭建双节点系统,板级验证表明:该设计满足协议规范,与同类设计方案相比,最高工作频率提高1.5倍,支持最高6.25 Gbit/s的传输速率,查找表资源和存储资源降低,寄存器资源相近,为开发具有自主知识产权的高速可靠SpaceFibre编解码器提供了参考。     

维修性增长趋势检验研究

对即时改进和延缓改进两种维修性增长规划方式进行了趋势检验研究.针对即时改进的维修性增长规划方式,提出了趋势检验的图示法和Laplace方法.针对延缓改进的维修性增长规划方式,根据修复率(第i阶段的修复率为μi)的顺序约束条件:∞>μm≥…≥μi≥…≥μ2≥μ1>0,探讨了指数分布和正态分布维修性增长趋势检验的区间估计法,并结合数值例说明了这些方法的可行性.