Dynamic Job-Shop Scheduling Algorithm Based on ACPM and BFSM

By analyzing the products processing trees which start processing on different time, the working procedures of products could be divided into the attached one, which has the only precursor and subsequence, and the unattached one When ACPM （allied critical path method） and BFSM （best fit scheduling method） are applied to these two procedures and the procedures are grouped, the compactness of the procedures should be taken into account The result of test with practical examples shows that scheduling algorithm presented in this paper is concise and satisfying for settling dynamic Job Shop scheduling