Scheduling on parallel dedicated machines with job rejection

We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ((Formula presented.)) minimising makespan, ((Formula presented.)) minimising makespan with release-dates, ((Formula presented.)) minimising total completion time, ((Formula presented.)) minimising total weighted completion time, ((Formula presented.)) minimising total load, and ((Formula presented.)) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.