An Algorithm for Finding D-Time Table  

作　　者：张钹 张铃 

机构地区：[1]Dept.of Computer Science and Technology,Tsinghua University,Beijing 100080 [2]Dept.of Mathematics,Anqing Teachers'College,Anhui 246011

出　　处：《Journal of Computer Science & Technology》1992年第1期62-67,共6页计算机科学技术学报（英文版）

摘　　要：In Ref.[1],we present a relation matrix description of temporal relation constraints.This pa- per is a sequel of [1].Given a set of temporal relation and time duration constraints,find a time-table which satisfies all the given conditions,that is called finding a D-time table.The construc- finn of D-time table and optimal D-time table and their computational complexity are discussed.In Ref.[1],we present a relation matrix description of temporal relation constraints.This pa- per is a sequel of [1].Given a set of temporal relation and time duration constraints,find a time-table which satisfies all the given conditions,that is called finding a D-time table.The construc- finn of D-time table and optimal D-time table and their computational complexity are discussed.

关 键 词：constraints ASSIGNMENT satis MERGING finding initially directed BOUNDS STEPS UNTIL 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]