In view of the special constraints such as operational direction constraint, precedence constraint, positional constraint, zoning constraint and synchronous constraint in the two-sided assembly line balancing problem, the characteristics of every constraint and the special requirements of task assignment are analyzed, and the corresponding mathematical model is built. A colonial competitive algorithm is proposed according to the model. To make every task sequence meet the precedence constraint, the binary tree adjustment algorithm is proposed. The efficiency of assigning the task only in the feasible solution space is improved. The LAHC algorithm is added in the algorithm as a local search algorithm, to improve the global search of the algorithm. Experiments are carried out to demonstrate the performance of the proposed method.