On an on-line scheduling problem for parallel jobs

被引：35
|
作者：
Naroska, E [1 ]
Schwiegelshohn, U [1 ]
机构：
[1] Univ Dortmund, Comp Engn Inst, D-44221 Dortmund, Germany
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 06期
关键词：
on-line algorithms; analysis of algorithms; scheduling;
D O I：
10.1016/S0020-0190(01)00241-1
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper addresses the non-preemptive on-line scheduling of parallel jobs. In particular we assume that the release dates and the processing times of the jobs are unknown. It is already known that for this problem Garey and Graham's list scheduling algorithm achieves the competitive factor 2 - 1/m for the makespan if m identical machines are available and if each job requires only a single machine for processing. Here, we show that the same factor also holds in the case of parallel jobs. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：297 / 304
页数：8
相关论文
共 50 条
  • [41] Scheduling fully parallel jobs
    Kai Wang
    Vincent Chau
    Minming Li
    [J]. Journal of Scheduling, 2018, 21 : 619 - 631
  • [42] Scheduling fully parallel jobs
    Wang, Kai
    Chau, Vincent
    Li, Minming
    [J]. JOURNAL OF SCHEDULING, 2018, 21 (06) : 619 - 631
  • [43] The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
    E. Angelelli
    Á.B. Nagy
    M.G. Speranza
    Zs. Tuza
    [J]. Journal of Scheduling, 2004, 7 : 421 - 428
  • [44] The on-line multiprocessor scheduling problem with known sum of the tasks
    Angelelli, E
    Nagy, AB
    Speranza, MG
    Tuza, Z
    [J]. JOURNAL OF SCHEDULING, 2004, 7 (06) : 421 - 428
  • [45] On-line scheduling of unit time jobs with rejection: minimizing the total completion time
    Epstein, L
    Noga, J
    Woeginger, GJ
    [J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (06) : 415 - 420
  • [46] Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
    Du D.-L.
    [J]. Acta Mathematicae Applicatae Sinica, 2005, 21 (3) : 485 - 488
  • [47] On-line scheduling
    Sgall, J
    [J]. ONLINE ALGORITHMS: THE STATE OF THE ART, 1998, 1442 : 196 - 231
  • [48] Optimal on-line algorithms for scheduling on parallel batch processing machines
    Zhang, GC
    Cai, XQ
    Wong, CK
    [J]. IIE TRANSACTIONS, 2003, 35 (02) : 175 - 181
  • [49] On-line scheduling of equal-length intervals on parallel machines
    Fung, Stanley P. Y.
    Poon, Chung Keung
    Yung, Duncan K. W.
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (10) : 376 - 379
  • [50] On-line scheduling of parallel machines to minimize total completion times
    Liu, Peihai
    Lu, Xiwen
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) : 2647 - 2652
12345