We discuss single machine scheduling problems with learning effects of setup and removal times and deterioration effects of processing time, i.e., the processing (setup or removal) time of a job is a function of its position . The objective functions are finding the optimal sequence of jobs to minimize a cost function containing makespan, total completion time and total absolute differences in completion times and to minimize a cost function containing makespan, total waiting time and total absolute differences in waiting times. The problems are modeled as an assignment problem respectively, and thus can be solved in polynomial time.