首页 | 本学科首页   官方微博 | 高级检索  
     


A note on a model for quay crane scheduling with non-crossing constraints
Authors:Alberto Santini  Henrik Alsing Friberg
Affiliation:1. Department of Electrical, Electronic and Information Engineering, University of Bologna, Italy;2. MOSEK Aps, 2100 Copenhagen, Denmark
Abstract: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.
Keywords:container terminals  quay crane scheduling  exact algorithms  mixed integer programming  non-crossing constraints
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号