AN APPLICATION OF THE BIN-PACKING TECHNIQUE TO JOB SCHEDULING ON UNIFORM PROCESSORS

被引:5
作者
VANDEVEL, H
SHIJIE, S
机构
关键词
BIN PACKING; MINIMUM MAKESPAN; SCHEDULING; UNIFORM PROCESSOR;
D O I
10.1038/sj/jors/0420210
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
A non-polynomial algorithm is presented for solving the minimum makespan problem on a set of uniform machines. This algorithm uses the bin-packing technique and provides an approximate solution which turns into an optimal one when the relative error is chosen small enough.
引用
收藏
页码:169 / 172
页数:4
相关论文
共 4 条
[1]  
Garey MR., 1979, COMPUTERS INTRACTABI
[2]   USING DUAL APPROXIMATION ALGORITHMS FOR SCHEDULING PROBLEMS - THEORETICAL AND PRACTICAL RESULTS [J].
HOCHBAUM, DS ;
SHMOYS, DB .
JOURNAL OF THE ACM, 1987, 34 (01) :144-162
[3]   A POLYNOMIAL-APPROXIMATION SCHEME FOR SCHEDULING ON UNIFORM PROCESSORS - USING THE DUAL APPROXIMATION APPROACH [J].
HOCHBAUM, DS ;
SHMOYS, DB .
SIAM JOURNAL ON COMPUTING, 1988, 17 (03) :539-551
[4]  
VANDEVEL H, 1990, IN PRESS BIT