基于Jess规则的数据库通知服务

提出一种实现数据库通知服务的技术框架,使用Jess规则代替SQL编码来表达用户的数据监控策略,规则执行时先由规则解释器将规则翻译成SQL语句然后执行.使用这种方法,数据监控策略易于理解和接受,修改方便;其次,可在规则解释器中实现异构数据库系统之间的关联通知服务;最后,Jess规则还可以进行复杂的推理,实现通知业务的智能化.     

Flow shop rescheduling problem under rush orders

INTRODUCTION Rescheduling problem in manufacturing system is considered as a particularly hard combinatorial optimization problem,closely related with uncer-tainty caused by exterior business environment and interior production conditions.Production resched-uling is a common practice in manufacturing compa-nies all over the world.Four sources of production disturbances have been identified:(1)incorrect work;(2)machine breakdowns;(3)rework due to quality problem;and(4)rush orders(Rangsarit…     

动态车辆调度系统的滚动时域调度算法

提出了一类特殊的动态车辆调度问题--动态独占性带时间窗口装卸货问题.给出了问题的数学描述,分析了其静态性质,并把问题简化为不对称带时间窗口旅行商问题.提出了求解该动态问题的滚动时域调度算法,通过时域的不断滚动,不仅可以跟踪问题的动态变化,还由于每次滚动只对部分客户进行处理,可以减少问题的求解时间.并分析了算法的3个要素:当前客户窗口、当前客户窗口的调度和滚动策略.测试结果验证了算法在求解动态车辆调度问题中的有效性.     

基于混合遗传算法的模糊车间调度问题

该文介绍了模糊流水车间调度问题，在此基础之上设计了一个解决该问题的混合遗传算法——嵌入多点最速下降法的遗传算法（GDA），将其与各种算法进行了仿真比较，论证了其有效性。     

基于PSO的控制系统中周期性任务的优化调度

控制系统中任务的调度不仅影响系统的资源利用率,而且影响系统的控制性能。首先分析了周期性实时任务,并给出了任务模型。基于此,采用了EDF调度算法。根据系统的性能指标与任务的采样周期的关系,采用粒子群算法对系统性能进行优化。仿真结果表明,这种算法是有效的。     

Overall plan and design of the task management system of ternary optical computer

In this paper an overall scheme of the task management system of ternary optical computer (TOC) is proposed, and the software architecture chart is given. The function and accomplishment of each module in the system are described in general. In addition, according to the aforementioned scheme a prototype of TOC task management system is implemented, and the feasibility, rationality and completeness of the scheme are verified via running and testing the prototype.     

组成于平行机和批处理机的二阶段混合流水作业问题

A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases： （1） b≥ an, max{m, B} 〈 n; （2） a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines.     

基于Linux的嵌入式实时操作系统的探析

在分析Linux和嵌入式实时操作系统的基础上，提出Linux的实时化、嵌入化的解决方案.     

两个加工时间恶化的半线性平行机排序问题的启发式MBLS 算法

The combination of online or semi-online with deterioration jobs has never been researched in scheduling problems. In this paper, two semi-online parallel machine scheduling problems with linear deterioration processing time are considered. In the first problem, it is assumed that the deterioration rates of jobs are known in an interval, that is, bj ∈[0, α], where 0 〈α≤ 1 and bj denotes the linear deterioration rate. In the second problem, it is assumed that the largest deterioration rate of jobs is known in advance, that is, b = max1≤j≤n {bj }. For each of the two problems, a heuristic MBLS algorithm is worked out and its worst-case ratio is analyzed. At the same time, the worst-case ratio of the list （LS） algorithm is investigated and it is proved that all the ratios are tight.     

高校选课制下自动排考系统的设计和实现

针对选课制环境下,上课和考试对象的动态化、个性化带来的各种复杂的考试安排问题,提出可描述的业务结构和基于自动布局的考试安排的概念、算法、实现方式,特别是具有人机协同架构的基于种子的成长式选优算法的设计和针对自动预案的评估、选择、调整的应用模式的实现,被实践证明取得令人满意的效果。作为实际使用的智能系统,对于高校自动化业务处理,在实用、易用、有效性等方面提供了成功的尝试。