Heuristic algorithm for optimizing insertion order schedule of agile supply chain

In order to solve the insertion order scheduling problem of agile supply chains for production planning,a two stage supply chain composed of one factory and many suppliers was studied.Taking the minimization of the total supply chain cost as the objective,an Integer Planning (IP) model was designed to describe the scheduling problem based on the time slot representation of each firm's available scheduling periods,and an One-by-One Selection Heuristic (OOSH) algorithm was proposed to resolve the IP model.Finally,by contrast with the calculation results of Distance Priority (DP) and Cycle Time Priority (CTP) algorithms in some scheduling experiments,the feasibility and effectiveness of the model and algorithm were verified.The experimental results also reveal that the form of agile supply chain is competitive.