Single Machine Scheduling With Precedence Constraints And Learning Effect

scheduling theory as an important branch of operational research, has a profound practical background and broad application prospects. It has been brought to the atten-tion of the academic circles at home and abroad. In recent years.There are many articles about the single machine scheduling with precedence constraints and the single machine scheduling with learning effect.In this paper, we discuss to have precedence constraints and learning effects of combined scheduling problems.This paper mainly discusses two kinds of models. The first class of models is a single machine scheduling problem with chain constraints and learning effect, namely1|chains,Pj=aj-βtar-1|Cmaxand1|chains, Pj=aj-βtατ-1|∑CjThe optimal algorithm are presented. The second class of models is a single machine scheduling problem with precedence constraints and learning effect.namely1|prec, Pj=aj-∞t∝r-1|Cmaxand1|prec, Pj=aj-∞lαr-1|∑CjThe approximate algorithm is presented.