| 浅谈基于浸润原理的事务安排算法 |
| |
| 引用本文： | 何建强. 浅谈基于浸润原理的事务安排算法[J]. 广西科学院学报, 2003, 19(4): 162-164 |
| |
| 作者姓名： | 何建强 |
| |
| 作者单位： | 广西民族学院数学与计算机科学系,南宁,530006 |
| |
| 摘 要： | 针对单个安排事务避免冲突的传统方法 ,提出一种基于浸润原理的事物安排算法。该算法采用漫布式将各个事务分摊到各个位置 ,根据条件计算权值 ,并有意造成冲突 ,从而发现冲突位置 ,最后从最不可能冲突的位置入手 ,逐步完成安排过程。该方法事务安排的复杂度为 O(n2× k× x) ,大大减少事务安排所需的时间 .
|
| 关 键 词： | 浸润原理 事务安排 算法 近似解 复杂度 |
| 收稿时间： | 2003-07-01 |
| 修稿时间： | 2003-07-01 |
Brief Introduction to Schedule-making Algorithm Based on Soakage |
| |
| He Jianqiang. Brief Introduction to Schedule-making Algorithm Based on Soakage[J]. Journal of Guangxi Academy of Sciences, 2003, 19(4): 162-164 |
| |
| Authors: | He Jianqiang |
| |
| Affiliation: | Dept. of Math. & Comp. Sci., Guangxi Univ. for Nationalities, Nanning, 530006 |
| |
| Abstract: | According to the traditional method for single and conflict avoidance schedule-making,a new schedule-making algorithm based soakage is introduced.This algorithm assigning the affairs into different positions by distribution,and seeking the conflict positions by conflicts of intend to cause via the condition calculating value,then finishing the scheduling progressively from the positions impossible.This method made the complexity of scheduling course reduced and the time of scheduling course shortened. |
| |
| Keywords: | scheduling soakage approximate solution |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《广西科学院学报》浏览原始摘要信息 |
|
点击此处可从《广西科学院学报》下载免费的PDF全文 |
|
