For the difficulties of flexible flow shop(FFS) dynamic scheduling problem, the problem’s character is analyzed,
and the model of the problem is built. Then based on the drum-buffer-rope(DBR) theory, the problem is decomposed
and simplified. The dynamic scheduling is done by composite rescheduling policy and heuristic algorithm. Finally the
coordinating rules of scheduling plan between bottleneck and non-bottleneck resource are built to solve the problem. An
example shows the feasibility and effectiveness of the algorithm.