Time-sensitive network technologies are widely used in industrial automation. The flow scheduling methods in this field mainly include static and dynamic scheduling. Static scheduling computes all flows at a time, which can save link and time resources to the greatest extent but has the disadvantages of long computation time and lack of flexibility to handle new flows. Dynamic scheduling computes new flows incrementally, with short computation time but insufficient resource allocation, resulting in time slot fragmentation. The global flow reconfiguration mechanism can periodically replan all flows in the network to optimize the allocation of link and time resources. However, this mechanism only applies to small networks with fewer flows, and an increase in the flow number can cause a sharp increase in computation time, affecting subsequent flows. This study designs a batch reconfiguration algorithm based on the existing dynamic scheduling algorithm. This algorithm provides a new evaluation indicator: network throughput. It can regularly reconfigure some flows to optimize network resource allocation while meeting the dynamic scheduling second-level response time requirement. In addition, the algorithm gives reconfigured flow selection standards and optimizes flow path selection standards and transmission start time calculation. This study conducts simulation experiments on the original and improved algorithm with the batch reconfiguration mechanism. The experimental results show that the improved algorithm can run in large networks with thousands of flows and have a 16.5% and 5.5% improvement in network throughput and the number of successfully scheduled flows while ensuring the second-level calculation time of the algorithm.