The computational complexity of ship shifting and berthing operation at dockyard

摘要

This paper exploits the complexities of the ship shifting and berthing operation at dockyard. Firstly establishes a shifting job problem graph model, and analyzes the solution of the model with the Bellman algebra theory. Finally it is proved that the ship shifting and berthing operation problem (SSOP) is a NPC problem and its approximate solution is also a NPC solution.