Many seaports worldwide are equipped with one-way navigation channel, in which only one direction is allowed to sail through at a time and vessels thus have to queue up to enter and leave the port alternately. This paper proposes a mixed-integer linear programming (MILP) model for integrated planning of berth allocation and vessel sequencing in such a one-way navigation channel seaport, aiming to minimize weighted dwelling time of all vessels. A tailored adaptive large neighborhood search algorithm is developed for solving the model within a reasonable time. To evaluate the solution quality, a lower bound of the solution of the problem is given by a column generation algorithm that solves a set-partitioning model adapted from the MILP model. Numerical experiments on Jingtang port of China show that (i) the integrated planning model can reduce 20.90%-29.21% of the weighted dwelling time of vessels compared to the current port scheduling schemes; and (ii) the proposed adaptive large neighborhood search algorithm outperforms the GUROBI solver and some existing methods, solving all problem instances within 3 minutes with a 4.83% average optimality gap. Some managerial insights are offered to guide the port operations in a one-way navigation channel seaport.