Scheduling Research And Application Of Two-stage Job Shop Scheduling Problem With Parallel Batch Machines For Aviation Standard Parts Enterprise

The heat treatment scheduling problem of aviation standard parts enterprise belongs to a type of batch-processing machine scheduling problem.Multiple jobs can be grouped into a batch and processed on a batch-processing machine simultaneously.In the production of aviation standard parts,the heat treatment process has the long processing time and the scheduling of the heat treatment ovens includes the strict constraints of job sizes and job families.Furthermore,the process is heavily affected by the arriving time of the upstream machining process.Thus,the heat treatment process has the highest energy consumption and utilization rate of machines,which lead the heat treatment process to be the bottleneck in the manufacturing processes and restrict the production capacity of the enterprise.How to implement an effective scheduling strategy for the heat treatment process to increase the heat treatment production capacity,shorten the production cycle,and reduce the ineffective energy consumption of the heat treatment to effectively control the production process of the enterprise has become an urgent problem for aviation standard parts enterprises.Therefore,the research on the batch scheduling problem of aviation standard parts has important theoretical value and practical significance for improving enterprise resource utilization rate,reducing production cost and improving production management level.This thesis focuses on the batch-processing machine scheduling problem of aviation standard parts enterprises.Based on a detailed review of the batch-processing machine scheduling problem and algorithms,the main research of content includes:1)The parallel batch-processing machine scheduling problem with incompatible job families was studied in the aviation standard parts enterprise,the arbitrary job sizes and dynamic job arrivals were also considered.First,a mathematical model was established and a lower bound of the problem was given.By analyzing the impact of job arrival time and job size on the optimization objective,the concept of idle space was introduced.An ant colony system algorithm based on local optimization strategy and a heuristic algorithm were proposed to minimize the makespan.The effectiveness of the proposed algorithms was proved by comparative analysis with lower bound and existing algorithms.2)The two-stage job shop scheduling problem with parallel batch machines was studied in the aviation standard parts enterprise,the incompatible job families and arbitrary job sizes were considered.First,a mathematical model was established and a lower bound of the problem was given.By analyzing the characteristics of the scheduling problem,the FGB scheduling framework was proposed to perform the batch formation first.Based on the FGB scheduling framework,an ant colony system algorithm and a heuristic algorithm were adopted to solve the problem of batch formation.The effectiveness of the proposed algorithms was proved by comparative analysis with lower bound and existing algorithms.3)Taking an aviation standard parts manufacturing enterprise as the background,a shop floor scheduling system with multiple algorithms was designed for the production scheduling problem of aviation standard parts enterprise,the effectiveness of the shop floor scheduling system was verified by applying actual data of the enterprise.The research of this thesis extends from parallel batch-processing machine scheduling problem to two-stage job shop scheduling problem with parallel batchprocessing machines.The contents of the thesis are interrelated and gradually progressive.The scheduling research was performed in the aviation standard parts enterprise for practical promotion and application...