Randomized on-line scheduling similar jobs to minimize makespan on two identical processors

被引：1
|
作者：
Du D.-L. [1 ]
机构：
[1] Faculty of Administration, University of New Brunswick, Fredericton, NB E3B 5V4
来源：
Acta Mathematicae Applicatae Sinica | 2005年 / 21卷 / 3期
关键词：
On-line algorithm; Preemption; Randomized algorithm; Scheduling;
D O I：
10.1007/s10255-005-0255-6
中图分类号：
学科分类号：
摘要：
In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to minimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound. © Springer-Verlag 2005.
引用
收藏
页码：485 / 488
页数：3
相关论文
共 50 条
12345