A note on a model for quay crane scheduling with non-crossing constraints

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. Original language English Journal Engineering Optimization Volume 47 Issue number 6 Pages (from-to) 860-865 Number of pages 6 ISSN 0305-215X DOIs https://doi.org/10.1080/0305215X.2014.958731 Publication status Published - 2015 Keywords 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