Study On Multi-objective Flexible Job-Shop Scheduling And Optimization Technology Based On APS

With global economy rapidly development, customers pay more attention to product individuation and diversity. On the other hand, owing to the rapid speed of production updating, product structures and product needs become uncertain.Therefore, Therefore,the traditional single specie or fewer specie and mass production pattern does’t adapt this complicated competitive environment,and it is instead of the multi-species and Small quantities production pattern.If companies want to meet the customer’s individual requirements with lower cost and higher efficiency and deal with the marketing change calmly, the managers had better organize production in the way of multi-objection flexible job-shop scheduling.As a result, multi-objection flexible job-shop scheduling problems has become a central issue in production scheduling area, and it also has become a hot spot of academic research and engineer-ing applications.Essentially, job-shop scheduling is responsible to attribute processing tasks set in time to available processing equipments set,and it is a multi-objection optimization problem.Because of most of these problems is NP-hard problem,so,it is always hard to solve these problems.This paper Introduces the idea of advanced planning scheduling (APS) based on the theory research to conditional job-shop scheduling, and it does some flexible job-shop scheduling and optimization technology.The main content of this paper are as followings.First, according the APS scheduling idea and the conditional job-shop scheduling theory, this paper builds the multi-objective Part Flexible Job Shop Scheduling model, and their objectives includes the maximum finishing time, the minimum maximum machines load, the minimum machines total load and the minimum advance time/delay time.Also,some constraints in model are like, the limited machines,on-time delivery and so on. Second, this paper designs a VNSGA algorithm to P-FJSP. In the solve process of Genetic Algorithm,the adaptive crossover and mutation ratio are introduced.Another, this paper introduces a mutation form based on variable neighborhood and changes the old tournament selection method and the old NSGA.The improved VNSGA algorithm is proved effective by programming MATLAB codes.Thirdly, by the empirical research to the job-shop scheduling of11th shop of an auto parts company in HangZhou, the improved algorithm can solve the rescheduling based on the machine error and urgent orders inserting, and the scheduling capability is obviously improved by introducing the new algorithm.