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.