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 条
12345