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 条

[41] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
Chai, Xing
Li, Wenhua
Zhu, Yuejuan
ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 79 - 93
[42] Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
Ming Liu
Chengbin Chu
Yinfeng Xu
Feifeng Zheng
Journal of Combinatorial Optimization, 2011, 21 : 138 - 149
[43] An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
Liu, Ming
Chu, Chengbin
Xu, Yinfeng
Zheng, Feifeng
OPTIMIZATION LETTERS, 2010, 4 (02) : 227 - 237
[44] An empirical analysis of stateful operator migration for online scheduling in distributed stream processing systems
Sornalakshmi, K.
Vadivu, G.
MICROPROCESSORS AND MICROSYSTEMS, 2023, 98
[45] Online-bounded analysis
Joan Boyar
Leah Epstein
Lene M. Favrholdt
Kim S. Larsen
Asaf Levin
Journal of Scheduling, 2018, 21 : 429 - 441
[46] Online-bounded analysis
Boyar, Joan
Epstein, Leah
Favrholdt, Lene M.
Larsen, Kim S.
Levin, Asaf
JOURNAL OF SCHEDULING, 2018, 21 (04) : 429 - 441
[47] Bounded Delay Scheduling with Packet Dependencies
Markovitch, Michael
Scalosub, Gabriel
2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2014, : 257 - 262
[48] Bounded delay scheduling with packet dependencies
Markovitch, Michael
Scalosub, Gabriel
COMPUTER COMMUNICATIONS, 2022, 182 : 98 - 109
[49] SCHEDULING PRECEDENCE GRAPHS OF BOUNDED HEIGHT
DOLEV, D
WARMUTH, MK
JOURNAL OF ALGORITHMS, 1984, 5 (01) : 48 - 59
[50] Autonomous Scheduling with Unbounded and Bounded Agents
Yadati, Chetan
Witteveen, Cees
Zhang, Yingqian
Wu, Mengxiao
la Poutre, Han
MULTIAGENT SYSTEM TECHNOLOGIES, PROCEEDINGS, 2008, 5244 : 195 - +

← 1 2 3 4 5 →