摘要
为了提高平行机调度的精度,提出了邻域搜索算法。数值试验表明了该算法能找到最优解或跟最优解非常接近的近似解。交换下降算法能有效地应用于多种平行机排序问题。
In order to improve the precision of the solutions to schedule parallel machines,the authors designed an neighborhood-region-search algorithm to solve this problem in this paper,and the optimal makespan or satisfying ap-proximate solution can be found with this algorithm according to numerical experimentation.Moreover,the neighborhood-region-search algorithm can be applied to many types of parallel-machines scheduling.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第18期103-104,110,共3页
Computer Engineering and Applications
关键词
平行机排序
邻域搜索算法
Parallel-machines scheduling,Neighborhood-region-search algorithm
