A note on ''an on-line scheduling heuristic with better worst case ratio than Graham's list scheduling''

被引：8

作者：

Chandrasekaran, R

Chen, B

Galambos, G

Narayanan, PR

VanVliet, A

Woeginger, GJ

机构：

[1] UNIV WARWICK,WARWICK BUSINESS SCH,COVENTRY CV4 7AL,W MIDLANDS,ENGLAND

[2] ATTILA JOZSEF UNIV,DEPT APPL COMP SCI,H-6720 SZEGED,HUNGARY

[3] ORTEC CONSULTANTS BV,NL-2803 PV GOUDA,NETHERLANDS

[4] GRAZ TECH UNIV,INST MATH,A-8010 GRAZ,AUSTRIA

来源：

关键词：

combinatorial problems; scheduling; worst-case bounds; on-line algorithms;

D O I：

10.1137/S0097539793258775

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

[No abstract available]

引用

页码：870 / 872

页数：3