一种改进的数据网格资源调度技术研究

研究了网格资源调度技术。针对网格任务的瞬变性、随机性等特点,提出了一种改进的网格资源调度算法。由于数据网格任务数量庞大,本文采用了并行遗传算法优化网格资源调度。实验结果表明,提出的改进的算法能够对大规模的数据网格任务进行有效调度,是一种有效的方法。     

负载自适应的CoMP调度策略

研究LTE-A下行CoMP调度技术.针对系统负载差异的场景,说明单一CoMP调度模式的缺陷;同时针对2类CoMP技术,给出相应地提高小区边缘和小区整体吞吐量的调度策略.通过理论分析和系统级仿真验证,研究系统负载对调度策略性能的影响,最后提出一种能自适应于非均衡负载的CoMP调度策略.综合评估表明,CoMP联合传输在低负载下和CoMP协调调度在高负载下均具有较优性能,而优化策略复杂度低,且能适应系统负载变化,可进一步提高系统性能.     

基于情境和知识集成的水资源调度流程的知识管理框架研究

水资源调度流程与其知识管理集成,能实现在正确的时间点、以正确的形式、把正确的知识传递给正确的水资源调度管理者,从而有效提高水资源调度管理水平。本文首先对水资源调度过程中信息采集、制定调度方案、组织调度、实施调度的知识管理需求进行分析,结合知识情境和知识管理的关系,提出用情境和知识集成的管理水资源调度流程,以此来实现水资源调度流程与知识管理的集成;其次并对知识建模技术、知识识别获取技术和知识检索技术等水资源调度流程和知识管理集成的关键技术进行探讨;然后在南水北调东线一期工程运营体制分析的基础上,基于情境和知识集成构建了南水北调东线一期工程调度的知识管理框架,该框架由两个信息系统和四个管理层面构成。     

一种带拒绝费用的排序问题研究

主要研究了一种带拒绝费用的排序问题。目标函数是在不超过总拒绝费用阀值的前提下使最大完工时间最小。首先,证明了该问题是N P-难的;然后我们针对这个问题设计出了伪多项式时间的动态规划算法,并给出了FPTAS。     

警务平台的优化设置及高效调度

利用Floyd算法及就近原则,首先建立了以点集为管辖范围、以出警时间最短、工作量相对均衡、总工作量最小为目标函数的多目标0-1整数规划模型,然后将原网络图转化为对偶图,建立了以路集为管辖范围的多目标0-1整数规划模型.此外,在一个平台的警力最多封锁一个路口的前提下,设计了快速全面封锁的方案,得到了8.015min的最佳封锁时间.     

遗传算法在云任务调度中的应用

云任务调度的目的是快速找到全局最优解.将多个云任务合理的分配给有限的资源上,使得整个任务的完成时间较短.文中主要介绍了遗传算法在云任务调度中的应用.通过仿真实验分析了采用精英策略的遗传算法和没有采用精英策略的遗传算法在云任务调度中的不同.     

No-cooperative games for multiple emergency locations in resource scheduling

When an emergency happens, the scheduling of relief resources to multiple emergency locations is a realistic and intricate problem, especially when the available resources are limited. A non-cooperative games model and an algorithm for scheduling of relief resources are presented. In the model, the players correspond to the multiple emergency locations, strategies correspond to all resources scheduling and the payoff of each emergency location corresponds to the reciprocal of its scheduling cost. Thus, the optimal results are determined by the Nash equilibrium point of this game. Then the iterative algorithm is introduced to seek the Nash equilibrium point. Simulation and analysis are given to demonstrate the feasibility and availability of the model.     

Block scheduled versus traditional biology teaching—an educational experiment using the water lily

In this study, we compared a traditional teaching sequence (four distinct lessons) with a block schedule dealing with the ecological adaptations of the water lily. The educational unit contained original plant material and both experimental groups received the same tasks and working sheets. Pupils worked together in groups of three to four pupils in a self-regulated manner, carrying out hands-on experiments. However, both groups differed in their time schedule (four distinct lessons of 45 min versus one block of 180 min). Pupils from the traditionally scheduled education performed significantly better in the immediate post-test while these differences merged in retention.     

Scheduling algorithm for multimedia services in IEEE 802.16e OFDM system

Based on five scheduling types and their QoS requirements defined in IEEE 802.16e specification, this paper proposes a new scheduring algorithm for non-real-time or real-time multimedia services. Taking the performances of efficiency, fairness and complexity into consideration, the proposed algorithm enhances the efficiency of air interface resource at the expense of the short-time unfairness, but ensures the long-time fairness. Moreover, the proposed algorithm introduces an efficient QoS assurance mechanism, which implements the functions of congestion control, queuing management and traffic management. The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. Especially on the occasion of heavy-traffic requirement, the performance of efficiency and fairness can be improved by 50% at most.     

工件加工时间退化且可拒的带优势关系流水作业问题的动态规划算法

The permutation flow shop scheduling problems with deteriorating jobs and rejection on dominant machines were studied. The objectives are to minimize the makespan of scheduled jobs plus the total rejection penalty and the total completion time of scheduled jobs plus the total rejection penalty. For each objective, polynomial time algorithms based on dynamic programming were presented.