Competitive Analysis of Scheduling Algorithms for Aggregated Links

被引:0
|
作者
Wojciech Jawor
Marek Chrobak
Christoph Dürr
机构
[1] University of California,Department of Computer Science
[2] Laboratoire d’Informatique de l’Ecole Polytechnique,CNRS
来源
Algorithmica | 2008年 / 51卷
关键词
Online algorithms; Scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
We study an online job scheduling problem arising in networks with aggregated links. The goal is to schedule n jobs, divided into k disjoint chains, on m identical machines, without preemption, so that the jobs within each chain complete in the order of release times and the maximum flow time is minimized.
引用
收藏
页码:367 / 386
页数:19
相关论文
共 50 条
  • [1] Competitive analysis of scheduling algorithms for aggregated links
    Jawor, W
    Chrobak, M
    Dürr, C
    [J]. LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 617 - 628
  • [2] Competitive analysis of scheduling algorithms for aggregated links
    Jawor, Wojciech
    Chrobak, Marek
    Duerr, Christoph
    [J]. ALGORITHMICA, 2008, 51 (04) : 367 - 386
  • [3] Experimental Analysis of Scheduling Algorithms for Aggregated Links
    Jawor, Wojciech
    Chrobak, Marek
    Molle, Mart
    [J]. APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 253 - 266
  • [4] Competitive algorithms for due date scheduling
    Bansal, Nikhil
    Chan, Ho-Leung
    Pruhs, Kirk
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 28 - +
  • [5] Competitive algorithms for multistage online scheduling
    Hopf, Michael
    Thielen, Clemens
    Wendt, Oliver
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (02) : 468 - 481
  • [6] Competitive Algorithms for Due Date Scheduling
    Bansal, Nikhil
    Chan, Ho-Leung
    Pruhs, Kirk
    [J]. ALGORITHMICA, 2011, 59 (04) : 569 - 582
  • [7] Competitive Algorithms for Due Date Scheduling
    Nikhil Bansal
    Ho-Leung Chan
    Kirk Pruhs
    [J]. Algorithmica, 2011, 59 : 569 - 582
  • [8] Competitive Flow Time Algorithms for Polyhedral Scheduling
    Im, Sungjin
    Kulkarni, Janardhan
    Munagala, Kamesh
    [J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 506 - 524
  • [9] Competitive analysis of on-line algorithms for on-demand data broadcast scheduling
    Mao, WZ
    [J]. I-SPAN 2000: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES ALGORITHMS AND NETWORKS, PROCEEDINGS, 2000, : 292 - 296
  • [10] Competitive analysis of algorithms
    Fiat, A
    Woeginger, GJ
    [J]. ONLINE ALGORITHMS, 1998, 1442 : 1 - 12