列表调度方法与其它方法相比，可以用较少的开销获得更好的结果。
List scheduling can produce more satisfactory solutions at significantly lower cost than other approaches.
文章提出了一种处理机个数无限的任务分配的列表调度算法，称之为节点迁移调度算法(ntsa)。
This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node - transferring scheduling algorithm (NTSA).
可以用您喜欢的调度程序每天运行此脚本一次，从而及时更新用户列表。
The script could be run from your favorite scheduler once a day to keep the user list up to date.
从这个简短的列表，您可以看到LinSched为建设调度方案提供了有用的API。
From this short list, you can see that LinSched provides a useful API for constructing scheduling scenarios.
每个调度器类都在一对一连接的列表中彼此相连，使类可以迭代(例如，要启用给定处理器的禁用)。
Each scheduler class is linked with one another in a singly linked list, allowing the classes to be iterated (for example, for the purposes of enablement of disablement on a given processor).
只有遇到这种情况，Gateway才尝试将请求转发到它的列表中的第二个调度程序，以此类推。
Only in this case the Gateway will try to forward the request to the second dispatcher in its list and so forth.
但Gateway组件只是将请求中继到它的已配置调度程序列表中的第一个可用 Dispatcher。
The Gateway component, though, does nothing to the request but relay it to the first available Dispatcher in it's configured list of dispatchers.
有没有办法让事件的组件调度列表？
Is there a way to get the list of events a component dispatches?
随着进程的执行和阻塞，他们将被重新置于相同优先级任务列表的尾部，从而进行有效的循环调度。
As processes run and block they will be re-queued at the end of the like priority task list and effectively be round robin scheduled.
用户可以负荷任务列表每日调度，便于调度。
User can load task list to Daily Scheduler for easy scheduling.
采用基于排列的方法和串行项目进度生成机制，结合多项目的任务列表，可以保证所得调度方案满足项目优先关系约束。
Combined with method based on order and serial schedule generation scheme and multi-project task list, the gotten scheduling scheme can meet the project schedule constraints of precedence relations.
本论文依据邻域结构和禁忌列表这两个关键点，提出了一种基于混合邻域结构的禁忌搜索算法来对加工车间调度问题进行研究。
In this paper, based on the neighborhood structure and the tabu list, a tabu Search algorithm based on hybrid neighborhood structure is propsed for solving JSSP.
本论文依据邻域结构和禁忌列表这两个关键点，提出了一种基于混合邻域结构的禁忌搜索算法来对加工车间调度问题进行研究。
In this paper, based on the neighborhood structure and the tabu list, a tabu Search algorithm based on hybrid neighborhood structure is propsed for solving JSSP.
应用推荐