Time sensitive networking (TSN) has been widely adopted and applied in many fields such as industrial Internet and mobile front haul. The scheduling problem of time sensitive networking (TSN) requires that the gate control list(GCL) is calculated according to the flow information in a given topology network, and then the end-to-end scheduling of flow in a specified time is realized. Conventional flow scheduling schemes are usually based on the given routing scheme rather than the overall algorithm decision, which limits the scheduling performance. In this paper, a routing scheduling algorithm based on tabu search is proposed on the basis of a comprehensive routing and GCL scheduling problem model, and the neighborhood movement strategy of routing and scheduling is proposed according to the proposed problem model. Besides, the simultaneous scheduling of both periodic and aperiodic flows is realized. Experimental results show that compared with the solver method, the proposed algorithm can save 75% of the time cost under the acceptable performance compromise in large-scale network scenarios.