Two Kinds Of Single-machine Problems According To The Same Learning Efect Model

As an applied science, scheduling is an important aspect of operations re-search. Recently it has become an active branch and a very broad appliedprospect since Biskup introduced the learning efect to scheduling feld. So it hasreceived considerable attention in the literature. In this dissertation, schedul-ing problems in intermittent batch production and group scheduling problems onsingle-machine with position-dependent learning efect are studied. The structureof the article is arranged as follows:In the frst chapter, some defnitions, notations and background informationabout the article are introduced. Then the main research results in the disserta-tion are summarized.In the second chapter, we consider single-machine scheduling problems withlearning and forgetting efects in intermittent batch production. The objectivefunctions of the problem are the makespan and total completion time, respec-tively. We discuss three models of no transmission, partial transmission andtotal transmission of the learning efect from batch to batch according to howlong the time has elapsed between production runs. We indicate that the formertwo models are polynomially solvable. Furthermore, we provide polynomial timealgorithms for special cases of the problem with the third models.In the third chapter, we consider some group scheduling problems on single-machine with position-dependent learning efect. The objective functions are thetotal completion time, maximum lateness and total lateness, respectively. We givepolynomial-time algorithm for the frst problem, and polynomial-time algorithmsfor the following two problems when due date is consistent with the processingtime. Furthermore, we provide the optimality of the polynomial-time algorithms.