［Purposes］Single machine scheduling with deteriorating jobs, rejection and availability constraints are considered. ［Methods］It is assumed that jobs have a different basic processing time and same deterioration rate, jobs can be rejected by paying penalties, the machines may be unavailable in a specified time intervals and jobs are non-resumable. The objective is to minimize the sum of the total completion time of the accepted jobs and the total rejection penalty of the rejected job. ［Results］For the NP-hard problem, the optimal solution can be obtained by sequencing in non-decreasing order of aj of the jobs before and after the unavailable interval. A pseudo-polynomial-time dynamic programming and a fully polynomial-time approximation scheme are designed. ［Conclusions］The existing models are generalized.