Users have differential delay requirements for data transmission in optical switching networks according to the nature of the data. In addition, it is an important factor to determine the network performance that how to satisfy the differential delay requirement while ensuring the scheduling efficiency of optical switching. At present, research on optical network scheduling is mainly based on single slot time or groups. The former does not consider the reconfi-guration overhead and thus cannot handle large-scale data exchange, while the latter ignores the need for different delays and QoS guarantees. In order to solve the problem of different data delay requirements for optical switching in data centers, this study proposes two new scheduling algorithms including stringent delay first (SDF) and m-order stringent delay first (m-SDF). The study also takes differential delay requirements, configuration order, reconfiguration overhead, and acceleration ratio of different data packets into account and adopts a greedy strategy in data scheduling. Furthermore, the study chooses a data packet that is the most sensitive to delay each time for priority scheduling, so as to meet the delay requirement. The proposed algorithms can maximize the transmission delay of more data packets under the premise of guaranteeing the delivery rate. The simulation results show that the two algorithms have a high delay satisfaction rate, which proves the effectiveness of the scheduling algorithms.