Scheduling Problem In Group Processing With Deterioration Processing Time

This thesis consists of four parts. Chapter one introduces some background information. Chapter two investigates single processor scheduling problem minimizing total completion time with group technology, flow shop scheduling problem minimizing makespan with group technology and flow shop scheduling problem minimizing total completion time with group technology. Optimal solutions of problems and Fm pi kj Cijare given. Scheduling problem in group processing to minimize makespan with an availability constraint on a single machine 1 pi j = ai Cmax can be solved using the 0-1 interger programming technique. Chapter three discusses Due window scheduling problem with uniform processing time for single machine. The objective function is the total fee. A brief mathematical formula is obtained to solve the problem. In chapter four, we summarize the results of the thesis and put forward some prospect.