Time-Sensitive Networking (TSN) is a new type of deterministic network. As its core mechanism, traffic scheduling mainly guarantees the quality of service of time-triggered stream transmission through Gate Control List (GCL). However, the design of gated scheduling in terms of frames requires the calculation of the specific time slot allocation for each frame, which has the problem of excessive computational complexity. For this reason, in order to address the complexity of solving the time slot configuration, the scheduling object is improved from frames to time windows. An Integer Linear Programming (ILP) scheduling method is designed based on time windows and its results are obtained using Gurobi optimizer. The simulation results show that the proposed scheduling method effectively reduces the computational complexity based on guaranteeing the flow characteristics of time-triggered flow. Compared with the frame-based scheduling method, the total end-to-end delay is reduced by about 6% and the solution time is reduced by about 41%.