This paper addresses a single machine scheduling problem with release dates, deadlines, setup costs and times, and the possibility to reject some jobs while encountering an abandon cost. The objective function to minimize is a sum of regular functions depending on the completion time of the jobs. The problem is inspired by a manufacturing scheduling problem. We design a greedy algorithm and a tabu search approach for the problem. We studied several restriction procedures. Realistic instances with up to 500 jobs are tackled.