文章提出了一种处理机个数无限的任务分配的列表调度算法,称之为节点迁移调度算法(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).
本论文依据邻域结构和禁忌列表这两个关键点,提出了一种基于混合邻域结构的禁忌搜索算法来对加工车间调度问题进行研究。
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.
应用推荐