| 同类处理机排序问题Q2｜｜C_(max)的一个算法 |
| |
| 引用本文： | 赵玉芳. 同类处理机排序问题Q2｜｜C_(max)的一个算法[J]. 辽宁大学学报(自然科学版), 1998, 0(4) |
| |
| 作者姓名： | 赵玉芳 |
| |
| 作者单位： | 沈阳师范学院数学计算机系 |
| |
| 摘 要： | 本文对ｎ个任务，２台同类处理机的排序问题Ｑ２｜｜Ｃｍａｘ进行讨论，提出一个算法．用该算法得到的排序表长的界是２ｂ＋１２ｂＭ＊．算法的复杂性为Ｏ（ｎｌｏｇｎ）．
|
| 关 键 词： | 组合最优化；排序；同类机排序 |
An Algorithm for Uniform Processors Scheduling Q2||C max |
| |
| Zhao Yufang. An Algorithm for Uniform Processors Scheduling Q2||C max[J]. Journal of Liaoning University(Natural Sciences Edition), 1998, 0(4) |
| |
| Authors: | Zhao Yufang |
| |
| Affiliation: | Zhao Yufang Department of Mathematics and Computer,Shenyang Normal College,Shenyang 110031 |
| |
| Abstract: | The scheduling problem with n tasks and two uniform processors Q2||C max was discussed. The boundary of scheduling length was 2b+12b M *, and the complexity of it was O(nlogn) by the proposed algorthm. |
| |
| Keywords: | Combinatorial optimization Scheduling Uniform processors scheduling. |
| 本文献已被 CNKI 等数据库收录！ |
