PREEMPTIVE SCHEDULING OF INDEPENDENT JOBS WITH RELEASE TIMES AND DEADLINES ON A HYPERCUBE

被引:11
作者
PLEHN, J
机构
[1] Forschungsinstitut für Diskrete Mathematik, Universität Bonn, 5300 Bonn 2
关键词
deadlines; Hypercube; preemptive scheduling; release times;
D O I
10.1016/0020-0190(90)90096-G
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
It is shown that the problem of preemptive scheduling of independent jobs with release times and deadlines on a hypercube can be formulated as a linear program. © 1990.
引用
收藏
页码:161 / 166
页数:6
相关论文
共 5 条
[1]   PREEMPTIVE SCHEDULING OF INDEPENDENT JOBS ON A HYPERCUBE [J].
CHEN, GI ;
LAI, TH .
INFORMATION PROCESSING LETTERS, 1988, 28 (04) :201-206
[2]   SOME SIMPLE SCHEDULING ALGORITHMS [J].
HORN, WA .
NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :177-185
[3]   A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR-PROGRAMMING [J].
KARMARKAR, N .
COMBINATORICA, 1984, 4 (04) :373-395
[4]   PREEMPTIVE SCHEDULING WITH RELEASE TIMES, DEADLINES, AND DUE TIMES [J].
MARTEL, C .
JOURNAL OF THE ACM, 1982, 29 (03) :812-829
[5]   A STRONGLY POLYNOMIAL ALGORITHM TO SOLVE COMBINATORIAL LINEAR-PROGRAMS [J].
TARDOS, E .
OPERATIONS RESEARCH, 1986, 34 (02) :250-256