A Relation Matrix Approach to Labelling Temporal Relations in Scheduling

• 作 者: 张钹 张铃
• 机 构: Dept.of Computer Science Tsinghua University,Beijing 100084,Dept.of Mathematics,Anqing Teacher's Col
• 出 处: Journal of Computer Science and Technology
• 发表日期: 1991年04期
• 关键词: Scheduling labelling polynomial constraints subset schedule partition satis latt

In this paper,we present a relation matrix description of temporal relations.Based on this modela new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm iscompleted and has a polynomial complexity.In general cases it is still an efficient algorithm comparedto some known algorithms.

In this paper, we present a relation matrix description of temporal relations.Based on this modela new algorithm for labelling temporal relations is proposed.Under certain conditions the algorithm is complex and has a polynomial complexity.In general cases it is still an efficient algorithm comparedto some known algorithms.