Agra, A., & Oliveira, M. (2018). MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. European Journal of Operational Research, 264(1), 138-148.
Barros, V. H., Costa, T. S., Oliveira, A. C., & Lorena, L. A. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60(4), 606-613.
Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168(3), 694-715.
Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675-689.
Blazewicz, J., Cheng, T. E., Machowiak, M., & Oguz, C. (2011). Berth and quay crane allocation: a moldable task scheduling model. Journal of the Operational Research Society, 62(7), 1189-1197.
Chang, D., Jiang, Z., Yan, W., & He, J. (2010). Integrating berth allocation and quay crane assignments. Transportation Research Part E: Logistics and Transportation Review, 46(6), 975-990.
Chang, D., Jiang, Z., Yan, W., & He, J. (2011). Developing a dynamic rolling-horizon decision strategy for yard crane scheduling. Advanced Engineering Informatics, 25(3), 485-494.
Cheng, J. K., Tahar, R. M., & Ang, C. L. (2011). A system dynamics approach to operational and strategic planning of a container terminal. International Journal of Logistics Systems and Management, 10(4), 420-436.
Diabat, A., & Theodorou, E. (2014). An integrated quay crane assignment and scheduling problem. Computers & Industrial Engineering, 73, 115-123.
Ernst, A. T., Oğuz, C., Singh, G., & Taherkhani, G. (2017). Mathematical models for the berth allocation problem in dry bulk terminals. Journal of Scheduling, 20(5), 459-473.
Fu, Y. M., & Diabat, A. (2015). A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Applied Mathematical Modelling, 39(3-4), 1194-1201.
Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232-245.
Hou, J. (2017, September). Dynamic berth allocation problem with two types of shore power for containership based on rolling horizon strategy. In Intelligent Transportation Engineering (ICITE), 2017 2nd IEEE International Conference on (pp. 144-149).
Imai, A., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B: Methodological, 39(3), 199-221.
Iris, Ç., Pacino, D., & Ropke, S. (2017). Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem. Transportation Research Part E: Logistics and Transportation Review, 105, 123-147.
Iris, Ç., Pacino, D., Ropke, S., & Larsen, A. (2015). Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Research Part E: Logistics and Transportation Review, 81, 75-97.
Liang, C., Huang, Y., & Yang, Y. (2009). A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering, 56(3), 1021-1028.
Meisel, F., & Bierwirth, C. (2009). Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E: Logistics and Transportation Review, 45(1), 196-209.
Park, Y. M., & Kim, K. H. (2005). A scheduling method for berth and quay cranes. In Container Terminals and Automated Transport Systems (pp. 159-181). Springer, Berlin, Heidelberg.
Raa, B., Dullaert, W., & Van Schaeren, R. (2011). An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Systems with Applications, 38(11), 14136-14147.
Rodriguez-Molins, M., Salido, M. A., & Barber, F. (2014). A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds. Applied intelligence, 40(2), 273-290.
Rodrigues, V., Morabito, R., Yamashita, D., da Silva, B., & Ribas, P. (2016). Ship routing with pickup and delivery for a maritime oil transportation system: MIP model and heuristics. Systems, 4(3), 31.
Stopford, M. (2013). Maritime economics. Routledge. (https://www.routledge.com/Maritime-Economics-3e-3rd-Edition/Stopford/p/book/9780415275583).
Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review, 54, 14-31.
Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148-161.
Xiao, L., & Hu, Z. H. (2014). Berth allocation problem with quay crane assignment for container terminals based on rolling-horizon strategy. Mathematical Problems in Engineering.
Yang, C., Wang, X., & Li, Z. (2012). An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Computers & Industrial Engineering, 63(1), 243-253.