An improved lower bound for rank four scheduling

被引：8
|
作者：
Chen, Lin [1 ]
Ye, Deshi [1 ]
Zhang, Guochuan [1 ]
机构：
[1] Zhejiang Univ, Coll Comp Sci, Hangzhou, Zhejiang, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2014年 / 42卷 / 05期
关键词：
Complexity; APX-hardness; Scheduling; APPROXIMATION;
D O I：
10.1016/j.orl.2014.06.003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider the classical minimum makespan scheduling problem, where the processing time of job j on machine i is p(ij), and the matrix P = (p(ij))(mxn) is of a low rank. It is proved in Bhaskara et al. (2013) that rank 7 scheduling is NP-hard to approximate to a factor of 3/2 - epsilon, and rank 4 scheduling is APX-hard (a factor of 1.03 - epsilon). We improve this result by showing that rank 4 scheduling is already NP-hard to approximate within a factor of 3/2 - epsilon. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：348 / 350
页数：3
相关论文
共 50 条
  • [1] An improved lower bound for the changeover scheduling problem
    Blocher, JD
    Chand, S
    [J]. IIE TRANSACTIONS, 1996, 28 (11) : 901 - 909
  • [2] An improved lower bound for a bi-criteria scheduling problem
    Yan, Jin
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 57 - 60
  • [3] A fast branch-and-bound algorithm with an improved lower bound for solving the multiprocessor scheduling problem
    Fujita, S
    Masukawa, M
    Tagashira, S
    [J]. NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 611 - 616
  • [4] A Lower Bound for Scheduling Mechanisms
    Christodoulou, George
    Koutsoupias, Elias
    Vidali, Angelina
    [J]. ALGORITHMICA, 2009, 55 (04) : 729 - 740
  • [5] A lower bound for scheduling mechanisms
    Christodoulou, George
    Koutsoupias, Elias
    Vidali, Angelina
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 1163 - +
  • [6] A Lower Bound for Scheduling Mechanisms
    George Christodoulou
    Elias Koutsoupias
    Angelina Vidali
    [J]. Algorithmica, 2009, 55 : 729 - 740
  • [7] A LOWER BOUND ON THE RANK OF MIXING EXTENSIONS
    KING, J
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 1987, 59 (03) : 377 - 380
  • [8] Approximation of holomorphic maps with a lower bound on the rank
    Kolaric, Dejan
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2008, 136 (04) : 1273 - 1284
  • [9] A lower bound for rank 2 lattice rules
    Pillichshammer, F
    [J]. MATHEMATICS OF COMPUTATION, 2004, 73 (246) : 853 - 860
  • [10] AN IMPROVED BL LOWER BOUND
    BROWN, DJ
    [J]. INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 37 - 39
12345