Scheduling with release times and rejection on two parallel machines

Abstract

In this paper we study scheduling with release times and job rejection on two parallel machines. In our scheduling model each job is either accepted and then processed by one of the two machines at or after its release time, or it is rejected and then a rejection penalty is paid. The objective is to minimize the makespan of the accepted job plus the total penalty of all rejected jobs. The scheduling problem is NP-hard in the ordinary sense. In this paper, we develop a $$1.5+\epsilon $$1.5+∈-approximation algorithm for the problem, where $$\epsilon $$∈ is any given small positive constant.