Online Scheduling with Bounded Migration

被引：73
|
作者：
Sanders, Peter [1 ]
Sivadasan, Naveen [2 ]
Skutella, Martin [3 ]
机构：
[1] Univ Karlsruhe TH, Fak Informat, D-76128 Karlsruhe, Germany
[2] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
[3] TU Berlin, Inst Math, D-10623 Berlin, Germany
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 2009年 / 34卷 / 02期
关键词：
scheduling; approximation; online algorithm; sensitivity analysis; BIN-PACKING; ALGORITHMS; TIME;
D O I：
10.1287/moor.1090.0381
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Consider the classical online scheduling problem, in which jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the constraint that the total size of moved jobs is bounded by some constant times the size of the arriving job. This constant is called the migration factor. For small migration factors, we obtain several simple online algorithms with constant competitive ratio. We also present a linear time "online approximation scheme," that is, a family of online algorithms with competitive ratio arbitrarily close to 1 and constant migration factor.
引用
收藏
页码：481 / 498
页数：18
相关论文
共 50 条
  • [21] Online Scheduling with Delivery Time on a Bounded Parallel Batch Machine with Limited Restart
    Liu, Hailing
    Wan, Long
    Yan, Zhigang
    Yuan, Jinjiang
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [22] Online Scheduling on a Bounded Batch Machine with Same-Length-Job Families
    Wang, Libo
    Li, Wenhua
    Chai, Xing
    Gao, Yanhong
    Yu, Dan
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2025,
  • [23] Semi-online scheduling with bounded job sizes on two uniform machines
    Cao, Qian
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 1 - 17
  • [24] Bounded delay packet scheduling in a bounded buffer
    Fung, Stanley P. Y.
    OPERATIONS RESEARCH LETTERS, 2010, 38 (05) : 396 - 398
  • [25] Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
    Ma, Ran
    Wan, Long
    Wei, Lijun
    Yuan, Jinjiang
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 156 : 31 - 38
  • [26] Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
    Li, Wenhua
    Gao, Jie
    Yuan, Jinjiang
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
  • [27] Online Bounded Analysis
    Boyar, Joan
    Epstein, Leah
    Favrholdt, Lene M.
    Larsen, Kim S.
    Levin, Asaf
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2016, 2016, 9691 : 131 - 145
  • [28] A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times
    Xiao, Man
    Li, Weidong
    THEORETICAL COMPUTER SCIENCE, NCTCS 2022, 2022, 1693 : 209 - 215
  • [29] An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
    Tao, Jiping
    Chao, Zhijun
    Xi, Yugeng
    Tao, Ye
    INFORMATION PROCESSING LETTERS, 2010, 110 (8-9) : 325 - 330
  • [30] Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
    Liu, Hailing
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2014, 543 : 24 - 36
12345