论文信息 - A note on a model for quay crane scheduling with non-crossing constraints

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.

[1] Lixin Miao,et al. Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[2] Alberto Delgado,et al. Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels , 2011, ICCL.

[3] Christian Bierwirth,et al. A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[4] Stefan Voß,et al. Operations research at container terminals: a literature update , 2007, OR Spectr..

[5] Stefan Voß,et al. Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[6] Der-Horng Lee,et al. An improved approach for quay crane scheduling with non-crossing constraints , 2010 .