.tabbox {width:400px; margin-top: 15px;margin-bottom: 5px} .tabmenu {width:400px;height:28px;border-left:1px solid #CCC;border-top:1px solid #ccc;} .tabmenu ul {margin:0;padding:0;list-style-type: none;} .tabmenu li { text-align:center; float:left; display:block; width:99px; overflow:hidden; background-color: #f1f1f1; line-height:27px; border-right:#ccc 1px solid; border-bottom:#ccc 1px solid; display:inline;} .tabmenu .cli {text-align:center;float:left;display:block;width:99px;overflow:hidden;background-color: #fff;line-height:27px;border-right:#ccc 1px solid;border-bottom:#fff 1px solid;display:inline; cursor:pointer; color: #810505; font-weight:bold} #tabcontent {width:399px;background-color:#fff;border-left:#CCC 1px solid;border-right:#CCC 1px solid;border-bottom:#CCC 1px solid; height:60px;} #tabcontent ul {margin:0;padding:5px;list-style-type: none;} #tabcontent .hidden {display:none;} Search Browse by Issue Fig/Tab Adv Search
 HOME ABOUT JCST AUTHORS REVIEWERS PUBLISHED PAPERS FORTHCOMING PAPERS

• Articles •

### An Algorithm for Finding D-Time Table

Zhang Bo; Zhang Ling;

1. Dept.of Computer Science and Technology Tsinghua University; Beijing; Dept.of Mathematics; Anqing Teachers College; Anhui;
• Online:1992-01-10 Published:1992-01-10

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.

 [1] Zhang Bo and Zhang Ling, The relation matrix approach to temporal planning. Journal of Computer Science and Technology, 1991,6(4).
 No related articles found!
Viewed
Full text

Abstract

Cited

Shared
Discussed
 [1] Harald E. Otto;. UNDO, An Aid for Explorative Learning?[J]. , 1992, 7(3): 226 -236 . [2] Ye Shiwei; Shi Zhongzhi;. A Necessary Condition about the Optimum Partition on a Finite Set of Samples and Its Application to Clustering Analysis[J]. , 1995, 10(6): 545 -556 . [3] WU Jie;. Reliable Communication on Cube-Based Multicomputers[J]. , 1996, 11(3): 208 -221 . [4] Tang Changjie; Xiong Min;. The Temporal Mechanisms in Hbase[J]. , 1996, 11(4): 365 -371 . [5] Xue Jinyun;. Unified Approach for Developing EfficientAlgorithmic Programs[J]. , 1997, 12(4): 314 -329 . [6] ZHENG Fang; XU Mingxing; MOU Xiaolong; WU Jian; WU Wenhu; FANG Ditang;. HarkMan—A Vocabulary-Independent Keyword Spotter for Spontaneons Chinese Speech[J]. , 1999, 14(1): 18 -26 . [7] WANG Xiaodong; XU Ming; ZHOU Xingming;. Fast Multicast on Multistage Interconnection Networks Using Multi-Head Worms[J]. , 1999, 14(3): 250 -258 . [8] Run-Yao Duan, Zheng-Feng Ji, Yuan Feng, and Ming-Sheng Ying. Some Issues in Quantum Information Theory[J]. , 2006, 21(5): 776 -789 . [9] Chiou-Yng Lee, Yung-Hui Chen, Che-Wun Chiou, and Jim-Min Lin. Unified Parallel Systolic Multiplier Over GF(2^m)[J]. , 2007, 22(1): 28 -38 . [10] Yongxi Cheng. Generating Combinations by Three Basic Operations[J]. , 2007, 22(6): 909 -913 .
 ISSN 1000-9000(Print)          1860-4749(Online) CN 11-2296/TP Home Editorial Board Author Guidelines Subscription Journal of Computer Science and Technology Institute of Computing Technology, Chinese Academy of Sciences P.O. Box 2704, Beijing 100190 P.R. China Tel.:86-10-62610746 E-mail: jcst@ict.ac.cn