Some Scheduling Problems With Environment Dependent Processing Times

Scheduling problem is one of the important combinational optimization problems. This thesis consists of six parts:Chapter one: Introduce some background information of the scheduling problem.Chapter two: Discuss the flow-shop scheduling problem with resource dependent processing times. The objective function is to minimize the total weighted completion time.Chapter three: Investigates single-machine scheduling problems with learning effect and deterioration. The objective function is respectively the makespan, the total completion time and the total square of completion time.Chapter four: Study the problem of single machine group scheduling with learning effect. The jobs in the group have the position-based learning effects. Different groups have the different learning factors. The objectives of the scheduling problems are respectively to minimize the makespan and the total completion time. It is proved that both of them can be solved by polynomial time algorithms.Chapter five: Discuss single machine scheduling problem with processing time depending on the allocation of resource and its start time.Chapter six: We give Summary of the thesis, as well as future prospects for further research work.