Crane Scheduling Using Tabu Search
ICTAI '02 Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence
Computers and Operations Research
A tabu search heuristic for the quay crane scheduling problem
Journal of Scheduling
Computers and Industrial Engineering
A fast heuristic for quay crane scheduling with interference constraints
Journal of Scheduling
A quay crane scheduling method considering interference of yard cranes in container terminals
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Modeling and solving rich quay crane scheduling problems
Computers and Operations Research
An efficient genetic algorithm for solving the quay crane scheduling problem
Expert Systems with Applications: An International Journal
Maritime repositioning of empty containers under uncertain port disruptions
Computers and Industrial Engineering
Hybrid evolutionary computation methods for quay crane scheduling problems
Computers and Operations Research
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem
Applied Soft Computing
Hi-index | 0.01 |
Scheduling of quay cranes at container terminals is a field of growing interest in research and practice. In the literature, we find diverse models for quay crane scheduling that consider the service of container vessels at different levels of detail. Currently, however, there exists no basis to compare the quality of planning that is achieved from these models. There is also no platform available that allows comparing different solution procedures and investigating conditions where they perform well or poorly. This paper presents a unified approach for evaluating the performance of different model classes and solution procedures. The approach is demonstrated by investigating the suitability of three models within a comprehensive computational study.