Approximation Algorithms for Scheduling with Rejection on Two Unrelated Parallel Machines

Feng Lin, Xianzhao Zhang, Zengxia Cai
2015 International Journal of Advanced Computer Science and Applications  
In this paper, we study the scheduling problem with rejection on two unrelated parallel machines. We may choose to reject some jobs, thus incurring the corresponding penalty. The goal is to minimize the makespan plus the sum of the penalties of the rejected jobs. We first formulate this scheduling problem into an integer program, then relax it into a linear program. From the optimal solution to the linear program, we obtain the two algorithms using the technique of linear programming rounding.
more » ... gramming rounding. In conclusion, we present a deterministic 3-approximation algorithm and a randomized 3approximation algorithm for this problem.
doi:10.14569/ijacsa.2015.061134 fatcat:fb7oli3ygzh2hkimzavczcf2bu