In this paper, we concern with the utilization and improvement of quantum-behavior heuristic algorithm for scheduling optimization problems. In order to solve a large-scale integral optimization problem with multiple extrema, a modified quantum-behavior algorithm with strong global searching ability is developed with the following measures, including a dynamic quantum rotation gate mechanism to improve the tendency of convergence, a criteria of annealing operation to improve global search ability, and a storage space and reconstruction operation for updating population. Meanwhile, a mathematical model of scheduling problem in container terminals is proposed named berth allocation, quay crane assignment and scheduling problem (BACASP). At last, several experimental studies of scheduling optimization problems are taken in the experiment section, which verifies the effectiveness and the superiority of the modified algorithm.