Scheduling Problem With Controllable Processing Times

This thesis consists of four parts. Chapter one introduces some background information. Chapter two investigates single processor scheduling problem minimizing makespan with group technology and single processor, scheduling problem of total completion time under the condition of linear deterioration of processing times. Optimal solutions of problem 1| P_ij =b_ij + a_ijt,S = Sf,GT | C_max and problem 1| p_j = b_j + C · t |∑C_j are given. Chapter three repectively discusses flow shop problem and open shop problem, in which the objection functions are minimizing mankspan under the condition of the processing time being depended on resources. The optimal resourse alloction and scheduling of problem F₂| chain ,p_ij = b_ij - a_ijμ_j , C_max and problem O₂| P_ij = b_ij - a_ijμ_j , U | C_max with a₂j=0 or with a_ij = aj are given. In Chapter four, we summarize the results of the thesis and put forward some prospect.