Abstract: For the complex product scheduling problem with no-wait constraint between operations in practical assembling manufacture, a method to change operations with no-wait constraint into a virtual operation is proposed. Based on the concepts of complex product, standard operation, virtual operation, no-wait and the expansion processing tree defined in this paper, the standard operations are processed by allied critical path method (ACPM) and best fit scheduling method (BFSM), and the virtual operations are processed respectively on corresponding machine with movement and exchange algorithm in order to translate scheduling problem with no-wait operations into the general scheduling problem with virtual operations. The result of the examples shows that the scheduling algorithm proposed is an effective solution to the complex product scheduling problem with no-wait constraint between operations and can be easily realized.