| Scheduling problem is one of the important combinatorial optimization problems. This thesis consists of five parts. Chapter one introduces some background information of the scheduling problem. Chapter two investigates several single-machine group scheduling problems respectively minimizing make-span and total completion time with linear processing time with respect to start time. Optimal solutions of problems 1| pij (a+ bt ), GT, S i|Cmax and 1| pi j ( a + bt ), GT , S i |∑Cij are given. Chapter three discusses single-machine scheduling problems with learning effect and deterioration. The job processing time is pj [r] = pjα(t )αr?1 and the objective function is Chapter four discusses single-machine scheduling problems with learning effect and deterioration including deteriorative setup times and derives polynomial-time optimal solutions. The job processing time is . The setup time is and the objective function is In chapter five, we give summary of the thesis, as well as future prospects for further research work.
|
PDF Full Text Request