Abstract: The movement and exchange algorithm can hardly resolve the existing complex products scheduling problem with no-wait constraint between operations. An integrated scheduling algorithm is proposed which makes no-wait constraint operation group (NWCOG) into linkage. The algorithm uses the expansion processing tree to make the operations with no-wait constraint into operation group, and determines the scheduling order of the operation group according to the number of operations which belong to NWCOG on path. Then lower complexity is obtained by reducing the restrictions of the NWCOG. For the preorder operations of each operation scheduled in the group, the scheduling order is determined by the processing order of operations in the group. For preorder operation of some operation, the scheduling order is determined by the allied critical path method (ACPM) which has lower complexity. After each of NWCOG is finished scheduling, the remained standard operations are scheduled by ACPM. Then, the first fit scheduling method (FFSM) is used to schedule the standard operations and the NWCOG. As the start time of the operation group is determined by the linkage-scheduling method, the secondary adjustments can be avoided and the complexity can be reduced. Analysis and examples show that the proposed algorithm has a lower complexity, better scheduling results and can be easier to implement.