Abstract: During the process to assemble the product or assembly which requires the high precision of the cooperation, to get the optimal assembly combination, a matching model is built based on the specific assembly relation by using network flow programming. After setting the proper mid-points and the proper capacity and direction of arcs in the model’s network and defining the general constraint of the model, the problem to get optimal assembly combination is transformed to the problem to get the maximum flow of network. Combining the relationship graph model with the hierarchical assembly model of product, a new assembly model is constructed to apply easily the matching model, and according to the hierarchical and down-top matching method, the optimal result is figured out after applying the matching model to match locally the parts of assembly. Moreover, the method above is proved by an example of application.

Key words: Assembly combination, Assembly model, Hierarchical and down-top, Match, Maximum flow of network