The heavy and empty wagon flow assignment with work division among multi-marshalling stations in railway terminal is presented. The problem is formulated as a linear programming model which considers some constraints indicating train arrival and departure, train breakup and makeup, wagons accumulation and wagons transshipping between different marshalling stations. The objective function makes minimization of the total cost of heavy and empty wagons entering, leaving, transshipping and accumulation. Using traditional methods for solving the large scale linear programming model is difficult and inefficient. A two-stage comprehensive optimization procedure is given and is abbreviated as two stage comprehensive optimization procedure(TSCOP), and a solving procedure is proposed to match train and marshalling station. The matching scheme is given by the capacity constraints group denoting train arrival and departure, and then the matching scheme is firstly updated by the capacity constraints group denoting train breakup, accumulation and makeup. And then the matching scheme is secondly updated by the capacity constraint denoting wagons transshipping. So the initial matching scheme set can be obtained. Moreover, the matching scheme is coded as a natural number sequence. The selection ratio is given and is adopted to choose a certain number of schemes to set up the filtered scheme set. An asynchronous iteration heuristic with replacing, variation and exchange operation is provided to find the optimal matching scheme from the filtered scheme set. The experimental scenarios are given to test the accuracy of the model and the effectiveness of the proposed heuristic.