Research On Complex Manufacturing System Scheduling Problem Based On Hybrid Jaya Algorithm

The scheduling of production plants has always been one of the most important issues in the planning and scheduling of modern manufacturing systems.Unlike the classical scheduling problems where handling was neglected,the scheduling problem with handling has received a lot of attention from researchers in recent years.In highly automated workshops,the selection of suitable handling robots and the design of reasonable transport solutions can effectively improve the quality of material distribution in the plant.Because of the high safety and low error rate of industrial robots,the light and flexible AGVs with strong controllability,the welldesigned algorithm is of great value and significance in the scheduling of complex manufacturing systems with robot manufacturing unit scheduling with multi-handling robots and multi-AGV flexible production scheduling with charging constraints.In this paper,a corresponding mathematical model is established for the two problems mentioned above,and a hybrid Jaya Algorithm(HJaya)with variable neighborhood descent search is designed to solve the two problems studied.The optimization objective considered in this paper is the maximum completion time,which is represented by three-layer coding method.In order to improve the quality of the initial solution,use rules-based strategies to generate initial solutions during initialization,and an individual updating mechanism is designed to solve the combinatorial optimization problem,and the search efficiency of the algorithm is improved by crossing operation and mutating operation based on the critical path.In order to prevent the algorithm from falling into local optimality,six kinds of neighborhood structures are used to improve the performance of the algorithm combined with the variable neighborhood descent search algorithm,and better production sequence and higher quality solutions can be obtained through these neighborhood structures.Finally,the corresponding simulation experiments are carried out,and the HJaya algorithm is verified and analyzed from the aspect of algorithm performance verification.Firstly,the HJaya algorithm is applied to three simple scenarios and the simulation Gantt chart shows that the HJaya algorithm can solve the two problems studied in this paper efficiently.The HJaya algorithm is then used to solve the Flexible Job Shop Scheduling Problem(FJSP)and the Job Shop Scheduling Problem with Transportation Time(JSPT)by relaxing the constraints of the problems presented in this paper.And compared with the existing objective values of other algorithms,the experimental results demonstrate the effectiveness of the HJaya algorithm.Finally,the HJaya algorithm is compared and analyzed with typical meta-heuristic algorithms.The comparison algorithm is written in strict accordance with the original algorithm framework by combining the constraints proposed in this paper,and the convergence of the algorithm is verified by analyzing the simulation results.