Abstract: The quay crane scheduling problem studied in this paper is to determine an assignment and a handling sequence of bays for quay cranes, considering the interference between quay cranes and the deck constraints. A mixed integer programming is proposed and some properties of the problem are deduced. A genetic algorithm is designed to obtain the near optimal solutions. A lowerbound is given to evaluate the effectiveness of the proposed algorithm. Computational experiments are conducted and it is shown that the proposed algorithm is effective and efficient in solving the problem.