Study On Scheduling Problems With Resources,Learning Effects,Deterioration Effects,Maintenance Activities And Duedate-windows

This paper consists of the following seven sections.We firstly introduce scheduling problems,giving some backgrounds,development and related notations.In chapter 2,we study the problem (?),A single machine scheduling problem with processes dependent on resources and two processes?In chapter 3,we discuss the problem (?),A single-machine group scheduling problems with the setup time where the processing time have learning effect and deterioration effect,We study the problem of makespan for the setup time having learning,deterioration effect and the processing time with learning effect and deterioration effect,respectively.We give the polynomial algorithm for the above the scheduling problems.In chapter 4,we mainly dicuss a class of single-machine scheduling problems where processing time is related to job start time with learning effect and position with learning effect.Then we study the problem of makespan,the total completion time,the total square of completion time and the maximum lateness,respectively.In chapter 5,we study the scheduling problem (?),a kind of single machine scheduling problem with maintenance activities,The goal is to find the optimal maintenance position and makespan.The problem can is equivalented to the 0-1 knapsack problem,and can is approximately equivalented to a special integer programming model.In chapter 6,we research a single machine scheduling problem with duedate-windows.The processing time of the job is related to its location and start processing time.The objective function is to minimize the cost function,which is related to the beginning time of the window,the size of the window,earliness-tardiness of the completion time of a job and so on.The summary of the paper and further discussions are given in chapter 7.