摘要
对带平行约束的多处理机调度问题，引进一种局部最优解的概念，并以此为基础，给出一种随机化迭代算法．若干实例的计算结果表明。
For the multiprocessor scheduling problems with parallel constraint conditions, a concept of local optimum has been inducted. Based on this concept, a random algorithm is given in this paper. The calculated results from many examples show that this algorithm is very effctive.
出处
《烟台大学学报（自然科学与工程版）》
CAS
1997年第1期1-6,共6页
Journal of Yantai University(Natural Science and Engineering Edition)
基金
国家自然科学基金
关键词
组合优化
排序
近似算法
多处理机
调度问题
combinatorial optimization, scheduling, approximate algorithm, randomized algorithm
