| 时间规划的关系矩阵法之简化 |
| |
| 引用本文： | 许道云. 时间规划的关系矩阵法之简化[J]. 贵州大学学报(自然科学版), 1993, 10(4): 200-206 |
| |
| 作者姓名： | 许道云 |
| |
| 作者单位： | 贵州大学计算机科学系 贵阳 |
| |
| 摘 要： | 就张钹等提出的时间规划的关系矩阵法,提出一个简化方法,这里不再分时间关系的单成分与多成分。简化后的方法对一般情形有效,而且不再考虑相容集,由此算法可以求出所有可能的时间安表排,且计算复杂性仍在多项式时间内。
|
| 关 键 词： | 时间规划 关系矩阵 矩阵 |
A Simplification of Relation Matrix Method of Temporal Planning |
| |
| Xu Daoyun. A Simplification of Relation Matrix Method of Temporal Planning[J]. Journal of Guizhou University(Natural Science), 1993, 10(4): 200-206 |
| |
| Authors: | Xu Daoyun |
| |
| Abstract: | In this paper, a simplification of matrix method of temporal planning given in [1]is presented. It is unnecessary to divide single component and multiple component of temporal relation. In general base, simplification method is an efficient algorithm, and not need considering consistency sets. We can find out all time tables, and finish in polynomial time. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
