An Algorithm for Finding D-Time Table

• 作 者: 张钹 张铃
• 机 构: Dept.of Computer Science and Technology Tsinghua University,Beijing 100080,Dept.of Mathematics,Anqin
• 出 处: Journal of Computer Science and Technology
• 发表日期: 1992年01期
• 关键词: constraints assignment finding initially bounds satis merging shortest onding di

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 atime-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 atime-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.