摘要
在文[1]中,我们提出了时间关系约束的关系矩阵表示法,本文是文[1]的继续.在给定的时间关系以及时间宽度的约束条件下,求同时满足这两个约束条件的时刻表,称为D-时刻表.文中讨论了D-时刻表、最优D-时刻表的求解方法以及它的计算复杂性.
In paper [1] , a relation matrix description of temporal relation constraints is presented. This paper is a sequel to paper [1] . Given a set of temporal relation and time duration constraints, the problem of finding a D-time table is just to find a time-table which satisfies all given conditions. The arrangement of D-time table, the optimal D-time table and their computational complexity are discussed in this paper.
出处
《计算机学报》
EI
CSCD
北大核心
1991年第12期881-892,共12页
Chinese Journal of Computers
基金
国家自然科学基金
关键词
D-时刻表
关系矩阵
算法
Relation matrix, R-time table. D-time table, optimal D-time table.