Abstract: Aiming to reduce end-to-end latency in audio video bridging (AVB) traffic scheduling within large-scale network architectures, a joint routing and scheduling algorithm called TSN-AVB was proposed by integrating time-sensitive networking (TSN) and AVB. This algorithm transforms AVB traffic scheduling into a no-wait job shop scheduling problem. By combining simulated annealing and tabu search heuristic algorithms, it searches for near-optimal scheduling solutions. The K-shortest path (KSP) algorithm is employed to identify load-balanced routing strategies, with optimal links selected for data transmission after comprehensive traffic load evaluation. Experimental results show that compared to traditional sequential KSP algorithms, the joint routing algorithm reduces traffic transmission completion time by approximately 11% when terminal counts increase from 100 to 400, and by about 10% when flow counts rise from 20 to 200. This joint routing algorithm effectively minimizes end-to-end AVB traffic latency in large-scale TSN architectures while significantly enhancing overall network performance.