No abstract

The quay crane scheduling problem plays an essential role in the port container terminal management paradigm, as it is closely related to the berthing time of ships. In this article, we focus on the quay crane scheduling problem based on a special strategy, which forces the quay crane to move in one direction during the process of unloading and loading the containers. The scheduling problem that arises when this strategy is applied is called the one-way scheduling problem of quay cranes in the literature. In this article, we seek a mathematical formula for the unidirectional scheduling problem of quay cranes that can be easily solved by genetic algorithms. This algorithm provides us with the best combination of containers to unload and load at the optimal time.

No abstract

No abstract

No abstract