Abstract In port container terminals, a vessel is usually divided longitudinally between head and tail into many holds to store containers, which must be loaded or unloaded by several quay cranes. The scheduling of quay cranes significantly influences the turn-around time of a container vessel. This paper studies a problem of scheduling small number of quay cranes with non-interference constraint. The objective is to minimize the overall time of loading or unloading the containers. New scheduling algorithms are designed and analyzed for three and four quay cranes, which improve previous results on this problem.
ZHANG Wen-shuai, ZHANG An, CHEN Guang-ting, CHEN Yong. Approximation algorithms of quay crane scheduling with non-interference constraints. Applied Mathematics A Journal of Chinese Universities, 2016, 31(3): 351-356.
