Research On Scheduling Problems With Multiple Maintenance And Processing Time Related To Resources

Scheduling is a way to optimize the problem by adjusting the order of the jobs to achieve some purpose.The quality of the ranking directly affects the size of the fee.The processing time of the workpiece is related to the position and resources of the group where the workpiece is located.The machine needs to be repaired after machining a set of workpieces and can be set as a constant.This article mainly studies the following types of problems:1)The general processing time is variable and multi-maintenance multi-window schedulingOn the basis of considering the group scheduling.Combine processing time with position.Maintenance activities are fixed,taking into account the advance cost of the artifacts,the cost of lost labor,the initial cost of the window,and the minimization of the window size.First to consider the optimal scheduling of the workpiece within the group,and then consider the sort between the groups so that the objective function is minimized.And put forward the corresponding algorithm.2)Resource constrained processing time variable and multi-maintenance multi-window schedulingThe introduction of resource constraints makes the issue more relevant to practical problems.Resources will affect the processing time of the workpiece,so as to optimize the cost objective function.Further consider the cost of resources to optimize the objective function.At the same time,the distribution of resources is also divided into convex resources and linear resources.Talk about one by one here.3)Multi-window stand-alone scheduling to minimize resourcesUnder the condition of resource constraints,the sum of the costs of advancement,lost time and deadlines of the workpieces should be minimized in a certain value,considering the convex resources and the linear resources respectively.