Abstract: In order to obtain a parallel disassembly sequence in which multiple people perform different dis- assembly tasks at the same time, a parallel disassembly sequence planning method considering disassembly operation constraints is proposed. Firstly, the disassembly sequence planning problem model is constructed from three aspects： geometry feasibility, disassembly time and space constraint of disassembly work. In or- der to avoid infeasible sequences, a rapid extraction and interference checking method for the disassembly operation space is proposed; aiming at the uncertain characteristics of disassembly time of recycled products, the interval number model is introduced to describe the disassembly time, the disassembly model contains three factors is constructed, which include the basic disassembly time, the disassembly tool preparation time and the disassembly station change time. Then the waiting mechanism of the ant colony search is designed based on the principle of collaborative work to acquire the parallel disassembly sequence solution. In order to further improve the quality and efficiency of the algorithm for solving the parallel disassembly sequence of complex products, the pheromone update method with self-adaptive capabilities and ant selection strategy are utilized to improve the basic ant colony algorithm. Finally, a bevel gear reducer is utilized as an example to discuss and analysis the value of key parameters, and the effectiveness of the constraint measures of the algorithm are verified.