Job Shop Processing And Handling Integrated Scheduling With Limited Buffer Area

Shop scheduling is significant part of the scheduling problem,and it is one of the most basic and common scheduling types in the production workshop.With the development of society,the manufacturing industry pays more and more attention to the efficiency of workshop production.Therefore,the handling equipment is introduced,but the efficiency is increased,and the processing and handling simultaneous scheduling problems with higher integration and complexity are caused.The current shop scheduling considers aspects of processing and handling,but ignores the production blockage caused by the limited buffer area of the processing equipment.Job Shop processing and handling integrated scheduling problem under the limited buffer area is considered in this paper,which mainly includes the following aspects:(1)Analysis of the problem.Analyze the three aspects of processing and handling integrated scheduling,handling status,and input/output buffer status,and comprehensively define and analyze the problems studied in this paper.(2)Established a related model.Aiming at the problem of integrated processing of processing and handling under the constraint of limited input/output buffer,a mathematical model is established and the goal of minimizing the maximum completion time is achieved.At the same time,the assignment of the handling equipment,the input/output buffer area to the workpiece processing and the handling sequence are considered,and the management rules of the handling equipment are set,so that the established model has certain practicability.(3)The artificial bee colony algorithm with role exchange was designed.The process-based coding method was used to randomly assign weights to each machining process and handling process.According to the problem characteristics,the order of decoding process and handling sequence was proposed.Heuristic rules and use realweight-based decoding.The above method is beneficial to both the differential evolution algorithm and the efficiency of the algorithm.(4)Through an example,we obtain the processing and handling Gantt chart of the optimal feasible solution,and gradually analyze the state change of the input/output buffer area of each processing device by the decoding process of the optimal solution,and give a reasonable Suggestions for input/output buffer size.(5)Through the EX standard test problems,set the input/output buffer area and the number of handling devices with different capacities,compare the MAS algorithm with the GAHA algorithm,and show the effectiveness of the algorithm.Different results from different input/output buffer sizes are analyzed to give reasons for the phenomenon.Finally,by analyzing the marginal effect of the buffer area,a reasonable setting suggestion of the input/output buffer area is given.