Single-Machine Group Scheduling Problems With Learning And Deterioration Effect

This thesis consists of five parts. Chapter one introduces some background information.Chapter two investigates several single-machine group scheduling problemsminimizing make-span and total completion time with position-dependent learningeffect. Optimal solutions of problems 1|(?), (?)and 1|(?) are given. Chapter three discusses single-machine problems with linear processing time with respect to start time. Group scheduling problems with learning effect and deterioration:1|(?) and1|(?) are discussed. Chapter four discusses scheduling problem with outtree-structured and deterioration effect: 1|p_j(a + bt_j),outtree |∑ω_jC_j. In Chapter five,y we summarize the results of the thesis and propose some new problems.