摘要
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.
