Some Single Machine Scheduling Problems With Learning Effects,Deterioration Effects,Maintenance Activities And Setup Times

This paper mainly consists of the following five sections:In Chapter 1,we briefly introduce the background,development,related symbols and the notation of scheduling problems.In Chapter 2,We firstly study the single-machine scheduling problem,1|pjr=(aj+bit)r?,VM f(s)|F,F?{Cmax,?Cj},with one-time maintenance activity,and we give the polynomial algorithm for each function F;Then we consider the problem with two maintenance activities,1|pjr=(aj+bit)r?,2VMf(s)|Cmax,and we give the polynomial algorithm for the problem.In Chapter 3,we mainly discuss the problem 1|pjr=aj(1+(?))r?|F,F?{Cmax,?Cj,Lmax},a single-machine scheduling problem with job-position-based deterioration effects.For each function F,we give the polynomial algorithm for the problem.In Chapter 4,we discuss a single-machine-group scheduling problem with deterioration effects and setup times:1|pijk(t)=aij(1-?t)?ik-1,si[q]=siqb,GT|F,F?{Cmax,?Cij}.For each function F,we give the polynomial algorithm for the problem.In Chapter 5,we give the summary of the paper and some further considerations.