Tabu Search for Container Dock Handling Scheduling

Container dock handling scheduling is a combinatorial optimization problem. It has important significance to improve the dock production efficiency. This problem belongs to NP-hard problems. It is very similar to hybrid flow shop scheduling in the form. But it is more complex than HFS because of the physical properties of ship structure and handling equipment. This paper establishes a mathematical model of this problem. And based on tabu rules, this paper proposes the neighborhood structure and neighborhood shrinkage method based on key line and assignment restriction. Combining instances, this paper illustrates the realization principle of tabu search algorithm.