Approximation algorithms for the multiprocessor scheduling with submodular penalties

In this paper, we consider multiprocessor scheduling with submodular penalties to extend multiprocessor scheduling with rejection to submodular function. An instance of the problem is given by n jobs and m machines with each job having a certain processing time on a machine. We aim to find a subset R of rejected jobs, and assign each of other jobs to one of the m machines. The objective is to minimize the sum of the makespan of the m machines and the rejection penalty R, where the rejection penalty is determined by a submodular function. For this problem, we design a non-combinatorial Lovasz rounding algorithm that achieves a worst-case guarantee of 3+52. Then, we consider a special case of this problem in which all the machines are identical, i.e. each job has the same processing time on any machine, and we design a combinatorial (2-1m-approximation algorithm based on the greedy method and list scheduling (LS) algorithm.

Automated summary

This paper discusses multiprocessor scheduling with submodular penalties, aiming to minimize the sum of makespan and rejection penalty by finding a subset of rejected jobs and assigning others to machines. Non-combinatorial and combinatorial algorithms are proposed for worst-case guarantee and special case scenarios, respectively.