On the parameterized tractability of single machine scheduling with rejection.

•We study the parameterized complexity of a scheduling problem with rejection.•The objective is to minimize the total completion time.•There is an upper bound on the total rejection cost.•We prove that the problem is W[1]-hard with respect to the number of accepted jobs.•We prove that the problem is fixed-parameter tractable for several other parameters.