A fast heuristic for quay crane scheduling with interference constraints

作者：Bierwirth Christian^*; Meisel Frank

来源：Journal of Scheduling, 2009, 12(4): 345-360.

DOI：10.1007/s10951-009-0105-0

• Container terminal operations
• Quay crane interference
• Unidirectional schedule
• Disjunctive graph model

This paper considers the problem of scheduling quay cranes which are used at sea port container terminals to load and unload containers. This problem is studied intensively in a recent stream of research but still lacks a correct treatment of crane interference constraints. We present a revised optimization model for the scheduling of quay cranes and propose a heuristic solution procedure. At its core a Branch-and-Bound algorithm is applied for searching a subset of above average quality schedules. The heuristic takes advantage from efficient criteria for branching and bounding the search with respect to the impact of crane interference. Although the used techniques are quite standard, the new heuristic produces much better solutions in considerably shorter run times than all algorithms known from the literature.

• 出版日期2009-8