This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced. Computational results show the effectiveness of these enhancements in solving the problem to optimality.
Engineering Optimization, 2015, Vol 47, Issue 6, p. 860-865
Container terminals; Exact algorithms; Mixed integer programming; Non-crossing constraints; Quay crane scheduling; Containers; Cranes; Integer programming; Port terminals; Problem solving; Railroad yards and terminals; Container terminal; Non-crossing constraint; Scheduling