ALGORITHMS AND COMPLEXITY OF THE PERIODIC MAINTENANCE PROBLEM

被引:13
作者
MOK, A [1 ]
ROSIER, L [1 ]
TULCHINSKY, I [1 ]
VARVEL, D [1 ]
机构
[1] UNIV TEXAS,DEPT COMP SCI,AUSTIN,TX 78712
来源
MICROPROCESSING AND MICROPROGRAMMING | 1989年 / 27卷 / 1-5期
关键词
D O I
10.1016/0165-6074(89)90128-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:657 / 664
页数:8
相关论文
共 11 条
[1]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2]  
BARUAH S, UNPUB COMPLEXITY PER
[3]   SELF-STABILIZING SYSTEMS IN SPITE OF DISTRIBUTED CONTROL [J].
DIJKSTRA, EW .
COMMUNICATIONS OF THE ACM, 1974, 17 (11) :643-644
[4]  
HOLTE R, 1989, 22ND P HAW INT C SYS, P693
[5]  
HOLTE R, 1989, MFCS 89 AUG
[6]  
Knuth D E, 1973, ART COMPUTER PROGRAM, V2
[7]   INTEGER PROGRAMMING WITH A FIXED NUMBER OF VARIABLES [J].
LENSTRA, HW .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (04) :538-548
[8]  
LEUNG H, 1980, INFORMATION PROCESSI, V11, P115
[9]   ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS [J].
LEUNG, JYT ;
WHITEHEAD, J .
PERFORMANCE EVALUATION, 1982, 2 (04) :237-250
[10]  
Stockmeyer L. J., 1976, Theoretical Computer Science, V3, P1, DOI 10.1016/0304-3975(76)90061-X