Referencias

C. Bierwirth and F. Meisel.: A survey of berth allocation and quay crane scheduling problems in container terminals.
European Journal of Operational Research, 202 (3): 615 – 627, 2010.
C. Bierwirth and F. Meisel.: A follow-up survey of berth allocation and quay crane scheduling problems in container terminals.
European Journal of Operational Research, 244 (3): 675 – 689, 2015.
K. Buhrkal, S. Zuglian, S. Ropke, J. Larsen, and R. Lusby.: Models for the discrete berth allocation problem: A computational comparison.
Transportation Research Part E: Logistics and Transportation Review, 47 (4): 461 – 473, 2011.
J.-F. Cordeau, G. Laporte, P. Legato, and L. Moccia.: Models and tabu search heuristics for the berth-allocation problem.
Transportation Science, 39 (4): 526–538, 2005.
doi: rm10.1287/trsc.1050.0120.
J. Du and J. Y.-T. Leung.: Minimizing total tardiness on one machine is np-hard.
Mathematics of Operations Research, 15: 483–495, 1990.
M. R. Garey and D. S. Johnson.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences).
W. H. Freeman, 1979.
M. Hendriks, D. Armbruster, M. Laumanns, E. Lefeber, and J. Udding.: Strategic allocation of cyclically calling vessels for multi-terminal container operators.
Flexible Services and Manufacturing Journal, 24: 248–273, 2012.
K. Huang, Suprayogi, and Ariantini.: A continuous berth template design model with multiple wharfs.
Maritime Policy & Management, 43 (6): 763–775, 2016.
A. Imai, E. Nishimura, and S. Papadimitriou.: The dynamic berth allocation problem for a container port.
Transportation Research Part B: Methodological, 35 (4): 401 – 417, 2001.
A. Imai, E. Nishimura, and S. Papadimitriou.: Berth allocation with service priority.
Transportation Research Part B: Methodological, 37 (5): 437 – 457, 2003.
A. Imai, Y. Yamakawa, and K. Huang.: The strategic berth template problem.
Transportation Research Part E: Logistics and Transportation Review, 72: 77–100, 2014.
Ç. Iris, E. Lalla-Ruiz, J. Lam, and S. Voss.: Mathematical programming formulations for the strategic berth template problem.
Computers & Industrial Engineering, 124: 167–179, 2018.
J. Jin, D.-H. Lee, and H. Hu.: Tactical berth and yard template design at container transshipment terminals: A column generation based approach.
Transportation Research Part E: Logistics and Transportation Review, 73: 168 – 184, 2015.
B. Korte and J. Vygen.: Combinatorial Optimization.
Springer-Verlag Berlin Heidelberg, 2006.
E. Lalla-Ruiz and S. Voss.: Popmusic as a matheuristic for the berth allocation problem.
Annals of Mathematics and Artificial Intelligence, 76: 173–189, 2016.
S. Martello and P. Toth.: Knapsack Problems; Algorithms and Computer Implementations.
Wiley-Interscience series in discrete mathematics and optimization. John Wiley and Sons, 1990.
M. Monaco and M. Sammarra.: The berth allocation problem: A strong formulation solved by a lagrangean approach.
Transportation Science, 41 (2): 265–280, 2007.
Xpress.: Fico $^{\tiny {\textregistered }}$ xpress solver.
https://www.fico.com/es/products/fico-xpress-solver.
Accessed: 2020-11-10.
D. Xu, C.-L. Li, and J.-T. Leung.: Berth allocation with time-dependent physical limitations on vessels.
European Journal of Operational Research, 216 (1): 47 – 56, 2012.
ISSN 0377-2217.