Scheduling Problems With Deterioration Effect And Controllable Processing Times On A Single Machine

In recent years, scheduling problems with controllable processing times are widely concerned by people, and related scheduling models are widely applied to all kinds of scheduling problems. In addition, maintenance activities of machines also play a more and more important role in the scheduling problems. Because it can improve production efficiency, more and more researchers at home and abroad will also take maintenance activities into account in the scheduling problems. In the paper, we discuss that scheduling problems with deterioration effect and controllable processing times on a single machine, the details are as follows:First of all, the first chapter introduces related knowledge, research status and main research contents; Secondly, the second chapter study single machine scheduling problems with resource-dependent processing times and effects of learning and deterioration. The actual processing times of jobs are related to the distribution of the resources and the starting time of processing, and each job has a due window. We mainly discuss two problems: the objective function of the first problem is to minimize the total costs of earliness, tardiness, the starting time of due windows, the size of due windows, resource allocation and makespan; the objective function of the second problem is to minimize the total costs of earliness, the number of tardy jobs, the starting time of due windows, the size of due windows, resource allocation and makespan. And we provide two polynomial algorithms, respectively. Thirdly, the third chapter based on the second chapter considers the deteriorating maintenance activity of the machine, in which the maintenance duration of the machine is a linear non-decreasing function of the starting time of the maintenance activity. And once the maintenance activity has been completed, the machine will revert to its initial condition and the aging effect will start anew. Our objective is to determine optimal sequence, optimal due dates,optimal maintenance position and optimal resource allocation so as to minimize the total costs of earliness, tardiness and due dates. And we provide a polynomial algorithm. Finally, we summarize the content of this paper, and put forward the possible development direction of the future.