Resource in the grid environment is dynamic. The traditional static job scheduling algorithm is not suitable for it.
网格中的资源都是动态的，传统的静态任务调度算法不能适应网格的动态特性。
By establishing grid resources performance measured-matrix, the paper constructed a job scheduling model, and gave a specific job scheduling algorithm based on this model.
通过建立网格资源性能量化矩阵，构建了一个作业调度模型，并基于此模型给出了一个具体的作业调度算法。
Finally, a tenant security service scheduling framework was implemented by combining the job scheduling algorithm within tenant and resource preemption algorithm among tenants.
最后结合租户内任务调度和租户间资源抢占算法，实现了租户安全服务调度框架。
Referring current research results on job scheduling algorithms in grid environments, this paper proposes a job scheduling algorithm based on greedy strategy and a self-adaptive algorithm.
在研究分析计算网格作业调度算法现有成果的基础上，本文提出了一种基于贪心策略的调度算法和一种自适应调度算法。
The key technology to improve the grid system efficiency is the job scheduling algorithm, how integrate various factors to making the scheduling algorithm more comprehensive is a challenging problem.
提升网格系统调度效率的关键在于作业调度算法，如何综合各种因素使得调度策略更为全面是一个有挑战性的问题。
A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.
提出了用于解决作业车间调度问题的离散版粒子群算法。
Import of the optimization theory in the field of job scheduling in workshop, improving the performance of algorithm, and making the algorithm work perfectly are important tasks.
将优化方法的理论研究引入到车间生产调度领域中，改进算法性能、拓宽算法应用领域、完善算法体系，是一个同时具有理论意义和应用价值的课题。
Then construct a distributed job shop scheduling system around the shop scheduling algorithm, so that it can be applied in practice.
接着围绕车间调度算法构建了分布式的车间调度系统，使其能在实际中得到应用。
The algorithm is based on the list scheduling principle by developing job sequences for the first stage and queuing the remaining stages in a FIFO manner.
所提出的算法基于表调度原理，首先给出在第一级工件的排列顺序，并在其后的各级采用先入先出(FIFO)方式。
This paper introduces the concept about the question of job scheduling with time limit, a general method of solving this question using greedy method and a fast algorithm which is improved.
介绍了带有限期作业排序问题的概念，以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。
The BACKFILL algorithm is not efficient for the CPU utilization of job scheduling in parallel system.
BACKFILL方法在并行作业调度时并不能有效地的利用CPU资源。
In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.
为了解决车间调度NP组合优化的难题，提出了基于免疫遗忘的车间调度算法。
A shortest-job-first packet scheduling algorithm to reduce the average response time of interactive network applications is proposed in the paper.
新的分组调度算法将最短作业优先准则在一定程度上应用于分组交换网络中。
In this paper, we propose an improved Lagrangian relaxation algorithm to solve job shop scheduling problems.
针对车间调度问题，提出了一种改进的拉氏松弛算法。
The particle swarm algorithm is introduced to job shop scheduling operation. Consequently, the function of job shop scheduling and control of the integration module is realized.
把二倍体混合遗传算法引入动态车间优化调度运算，从而使集成模型中动态生产调度与控制功能得以实现。
The particle swarm algorithm is introduced to job shop scheduling operation. Consequently, the function of job shop scheduling and control of the integration module is realized.
把二倍体混合遗传算法引入动态车间优化调度运算，从而使集成模型中动态生产调度与控制功能得以实现。
应用推荐