A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- 1 June 2014
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 235 (2), 399-411
- https://doi.org/10.1016/j.ejor.2013.08.015
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Models for the discrete berth allocation problem: A computational comparisonTransportation Research. Part E, Logistics and Transportation Review, 2011
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling timeEuropean Journal of Operational Research, 2010
- Heuristics for the integration of crane productivity in the berth allocation problemTransportation Research. Part E, Logistics and Transportation Review, 2009
- The simultaneous berth and quay crane allocation problemTransportation Research. Part E, Logistics and Transportation Review, 2008
- Berthing ships at a multi-user container terminal with a limited quay capacityTransportation Research. Part E, Logistics and Transportation Review, 2008
- An algorithm for the generalized quadratic assignment problemComputational Optimization and Applications, 2007
- Yard crane scheduling in port container terminalsApplied Mathematical Modelling, 2005
- A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysisOperations Research Letters, 2002
- Scheduling with multiple-job-on-one-processor patternIIE Transactions, 1998
- The berth planning problemOperations Research Letters, 1998