Some Scheduling Problems With Recoverable Degradation Effects After Maintenance Activities And Learning Effects

This paper researches the scheduling problem of the degradation effect requiring restart and the learning effect continuing after the maintenance activities.Under the condition of both learning effect and recoverable degradation effect,the single machine scheduling problems and multi-machine scheduling problems are studied in this paper.In the single machine scheduling problems,the minimization of the machine completion cost and the minimization of the maximum completion time with the same and different original processing time are discussed respectively.When the objective function is to minimize the machine cost and minimize the maximum completion time and the original processing time of jobs is the same,the corresponding theorems,properties and algorithms are presented.When the objective function is to minimize the cost of machine completion and the number of maintenance activities is delimited and the original processing time of jobs is different,the optimal algorithm is proposed.When the objective function is to minimize the machine cost and minimize the maximum completion time and the original processing time of jobs is different,the corresponding theorems,properties and algorithms are proposed.In this paper,the scheduling problem of identical processors and the scheduling problem of uniform processors are studied when the original processing time of the job is the same.