The single machine scheduling with a nonlinear deterioration function processing time and the past sequence dependent (p s d) setup time was considered. The problem was proved to minimize the makespan,total completion time were polynomial time solvable. In addition, the problem to minimize the total weighted completion time,the total tardiness and the maximum lateness were polynomial time solvable under certain condition.