Experimental comparison of approximation algorithms for scheduling unrelated parallel machines

被引:24
|
作者
Vredeveld, T [1 ]
Hurkens, C [1 ]
机构
[1] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
关键词
D O I
10.1287/ijoc.14.2.175.119
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
T his paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-relaxation or to a convex quadratic-programming relaxation. We also investigate dominance relations among the lower bounds resulting from these relaxations.
引用
收藏
页码:175 / 189
页数:15
相关论文
共 50 条
  • [1] APPROXIMATION ALGORITHMS FOR SCHEDULING UNRELATED PARALLEL MACHINES
    LENSTRA, JK
    SHMOYS, DB
    TARDOS, E
    [J]. MATHEMATICAL PROGRAMMING, 1990, 46 (03) : 259 - 271
  • [2] Approximation Algorithms for Scheduling with Rejection on Two Unrelated Parallel Machines
    Lin, Feng
    Zhang, Xianzhao
    Cai, Zengxia
    [J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2015, 6 (11) : 260 - 264
  • [3] Approximation algorithms for scheduling unrelated parallel machines with release dates
    Avdeenko, T. V.
    Mesentsev, Y. A.
    Estraykh, I. V.
    [J]. INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGIES IN BUSINESS AND INDUSTRY 2016, 2017, 803
  • [4] Improved approximation schemes for scheduling unrelated parallel machines
    Jansen, K
    Porkolab, L
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (02) : 324 - 338
  • [5] A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
    Gairing, M
    Monien, B
    Woclaw, A
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 828 - 839
  • [6] A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
    Gairing, Martin
    Monien, Burkhard
    Woclaw, Andreas
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 380 (1-2) : 87 - 99
  • [7] Exact and approximation algorithms for makespan minimization on unrelated parallel machines
    Martello, S
    Soumis, F
    Toth, P
    [J]. DISCRETE APPLIED MATHEMATICS, 1997, 75 (02) : 169 - 188
  • [8] Approximation algorithms for mixed batch scheduling on parallel machines
    Wang, Dong
    Fang, Kan
    Luo, Wenchang
    Ouyang, Wenli
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2024,
  • [9] 2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines
    Azar, Yossi
    Champati, Jaya Prakash
    Liang, Ben
    [J]. INFORMATION PROCESSING LETTERS, 2018, 139 : 39 - 43
  • [10] Approximating scheduling unrelated parallel machines in parallel
    Serna, M
    Xhafa, F
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 21 (03) : 325 - 338