Research On Single Batch Processor Scheduling Problem With Considering Preventive Maintenance Of Equipment

In modern industrial production,production scheduling problem is a classic problem and the batch processor scheduling problem is an important branch of production scheduling problem.In previous studies,scholars have generally assumed that machines can only process one artifact at the same time.Batch scheduling problems allow processing equipment to process multiple artifacts at the same time.Therefore,batch scheduling problem also needs to decide how to batch the workpiece,that is,batch scheduling problem is more complex and has been proved to be NP hard problem.The production equipment will be damaged after being used for a long time which will affect the whole production schedule.In view of this,this paper studies the batch scheduling problem considering the preventive maintenance constraint of equipment.It has a great significance in theoretical research and practical application.This paper studies the scheduling problem of single batch processor considering fixed period and variable period preventive maintenance and the mathematical model of scheduling problem is established.It designs the ant colony optimization algorithm and the improved ant colony algorithm.The correctness of the model and the effectiveness of the algorithm are verified by experiments.Specific research contents are as follows:Firstly,This paper describes the background and research significance of scheduling problem and preventive maintenance strategy of single batch processor.At the same time,the research characteristics of the current problem and the algorithm for solving related problems are elaborated,and the general idea of the research topic in this paper is summarized.Secondly,considering the limitation of fixed period preventive maintenance and variable period preventive maintenance,the definition of scheduling problem of single batch processor is given.Meanwhile,this paper builds the mathematical model of scheduling problem of single batch processor.Minimize maximum batch completion time and minimize batch early/late penalty costs as optimization objectives.Thirdly,It designs the ant colony optimization algorithm to solve the batch scheduling problem of fixed period preventive maintenance and variable period preventive maintenance of equipment,and various solving operators of the ant colony optimization algorithm,such as pheromone update and transfer probability value calculation.An improved ant colony optimization algorithm is designed to solve the scheduling problem of a single batch processor with fixed period preventive maintenance.Finally,In this study,test cases of different sizes are randomly generated for simulation experiments.In order to verify the performance of the algorithm,an experiment is designed in which different parameters are selected to solve the ant colony algorithm iteratively and different algorithms are applied to solve the problem in this paper.The experimental results show that the improved ant colony algorithm designed in this paper is suitable for solving the scheduling problem of single batch processor with fixed period preventive maintenance,and it has good timeliness.Meanwhile,the ant colony optimization algorithm designed in this paper can be used to solve the scheduling problem of single batch processor considering variable period preventive maintenance of equipment.