In order to effectively resist the influence of various interference events on the berth allocation plan of container terminal, it is necessary to formulate a berth allocation plan which is robust and easy to recover and adjust. From the perspective of the former, this paper carried out the following research on the berth allocation of container terminals: firstly, the events that interfered with the implementation of berth allocation plan in the wharf were identified and classified; then, by quantifying the impact of the above interference events on the berth allocation model, aiming at minimizing the waiting time cost, departure delay time cost and berth offset cost, a mixed integer programming model (MILP) considering multiple kinds of interference events was proposed; finally, a heuristic algorithm, the squeak wheel optimization (SWO) algorithm was designed to solve the large-scale berth allocation problem. By randomly generated example, the effectiveness of the berth allocation model considering multiple interference events and the squeak wheel algorithm were verified. The berth allocation plan generated by proposed MILP model is more robust and easier to adjust the wharf plan than the deterministic model in the case of interference events.