Optimal preemptive online scheduling to minimize lp norm on two processors

被引:5
|
作者
Du, Donglei
Jiang, Xiaoyue
Zhang, Guochuan
机构
[1] Univ New Brunswick, Fac Adm, Fredericton, NB E3B 5A3, Canada
[2] Louisiana State Univ, Coll Engn, Baton Rouge, LA 70803 USA
[3] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
关键词
on-line algorithm; scheduling; preemption; l(p) norm;
D O I
10.3934/jimo.2005.1.345
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We consider an on-line scheduling problem, where jobs arrive one by one to be scheduled on two identical parallel processors with preemption. The objective is to minimize the machine completion time vector with respect to the l(p) norm. We present a best possible deterministic on-line scheduling algorithm along with a matching lower bound.
引用
收藏
页码:345 / 351
页数:7
相关论文
共 50 条
  • [1] Optimal preemptive online scheduling to minimize lp norm on two processors (vol 1, pg 345, 2005)
    Du, Donglei
    Shuai, Tianping
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2008, 4 (02) : 339 - 341
  • [2] Optimal preemptive semi-online scheduling on two uniform processors
    Du, DL
    [J]. INFORMATION PROCESSING LETTERS, 2004, 92 (05) : 219 - 223
  • [3] An optimal on-line algorithm for preemptive scheduling on two uniform machines in the lp norm
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 316 - +
  • [4] Optimal preemptive semi-online scheduling to minimize makespan on two related machines
    Epstein, L
    Favrholdt, LM
    [J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (04) : 269 - 275
  • [5] On-line preemptive machine scheduling with lp norm on two uniform machines
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. JOURNAL OF SCHEDULING, 2015, 18 (02) : 185 - 194
  • [6] An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
    Jiang, Yiwei
    Zhou, Wei
    Zhou, Ping
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2018, 35 (03)
  • [7] A lower bound for the on-line preemptive machine scheduling with lp norm
    Shuai, Tianping
    Du, Donglei
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2008, 5092 : 661 - +
  • [8] Preemptive on-line scheduling for two uniform processors
    Wen, JJ
    Du, DL
    [J]. OPERATIONS RESEARCH LETTERS, 1998, 23 (3-5) : 113 - 116
  • [9] PREEMPTIVE SCHEDULING TO MINIMIZE MAXIMUM COMPLETION-TIME ON UNIFORM PROCESSORS WITH MEMORY CONSTRAINTS
    MARTEL, C
    [J]. OPERATIONS RESEARCH, 1985, 33 (06) : 1360 - 1380
  • [10] Preemptive Online Scheduling: Optimal Algorithms for All Speeds
    Ebenlendr, Tomas
    Jawor, Wojciech
    Sgall, Jiri
    [J]. ALGORITHMICA, 2009, 53 (04) : 504 - 522