Approximation algorithms for precedence-constrained identical machine scheduling with rejection

被引：0
|
作者：
Xianzhao Zhang
Dachuan Xu
Donglei Du
Chenchen Wu
机构：
[1] Linyi University,College of Science
[2] Beijing University of Technology,Department of Information and Operations Research, College of Applied Sciences
[3] University of New Brunswick,Faculty of Business Administration
[4] Tianjin University of Technology,College of Science
来源：
Journal of Combinatorial Optimization | 2018年 / 35卷
关键词：
Scheduling; Rejection; Approximation algorithm; Linear programming; Rounding;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study a precedence-constrained identical parallel machine scheduling problem with rejection. There is a communication delay between any two jobs connected in the precedence network where jobs may be rejected with penalty. The goal is to minimize the sum of the makespan and the rejection cost. We propose two 3-approximation algorithms for this problem under linear and submodular rejection costs respectively. These two algorithms are both based on linear programming rounding technique.
引用
收藏
页码：318 / 330
页数：12
相关论文
共 50 条
  • [1] Approximation algorithms for precedence-constrained identical machine scheduling with rejection
    Zhang, Xianzhao
    Xu, Dachuan
    Du, Donglei
    Wu, Chenchen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 318 - 330
  • [2] Approximating precedence-constrained single machine scheduling by coloring
    Ambuhl, Christoph
    Mastrolilli, Monaldo
    Svensson, Ola
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 15 - 26
  • [3] Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
    Chudak, FA
    Shmoys, DB
    JOURNAL OF ALGORITHMS, 1999, 30 (02) : 323 - 343
  • [4] Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds
    Chudak, FA
    Shmoys, DB
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 581 - 590
  • [5] SCHEDULING OF PRECEDENCE-CONSTRAINED TASKS ON MULTIPROCESSORS
    PRICE, CC
    SALAMA, MA
    COMPUTER JOURNAL, 1990, 33 (03): : 219 - 229
  • [6] An exact algorithm for the precedence-constrained single-machine scheduling problem
    Tanaka, Shunji
    Sato, Shun
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 229 (02) : 345 - 352
  • [7] Precedence-Constrained Scheduling of Malleable Jobs with Preemption
    Makarychev, Konstantin
    Panigrahi, Debmalya
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 823 - 834
  • [8] A cutting plane approach for the multi-machine precedence-constrained scheduling problem
    Prahalad Venkateshan
    Joseph Szmerekovsky
    George Vairaktarakis
    Annals of Operations Research, 2020, 285 : 247 - 271
  • [9] A cutting plane approach for the multi-machine precedence-constrained scheduling problem
    Venkateshan, Prahalad
    Szmerekovsky, Joseph
    Vairaktarakis, George
    ANNALS OF OPERATIONS RESEARCH, 2020, 285 (1-2) : 247 - 271
  • [10] Simple Approximation Algorithms for Minimizing the Total Weighted Completion Time of Precedence-Constrained Jobs
    Jaeger, Sven
    Warode, Philipp
    2024 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2024, : 82 - 96
12345