摘要
本文给出一种时间关系的关系矩阵描述方法,基于这种描述,提出了一种时刻表安排的新算法.这种算法在一定的假设条件下,是完备的且仅具有多项式的计算复杂性.对于一般情况,本方法也给出较有效的算法.
A relational matrix description of temporal relation is presented. Based onthe description a new scheduling algorithm is proposel. Under certain condition the algorithm is complete and has polynomial complexity. In general cases it still is an efficient algorithm.
出处
《计算机学报》
EI
CSCD
北大核心
1991年第6期411-422,共12页
Chinese Journal of Computers
关键词
时间规划
关系矩阵法
人工智能
Temporal planning, relational matrix, R-time table, D-time table, optimal D-time table.
