Integrated production planning, berth allocation, and time‐variant quay crane assignment scheduling problem

Abstract

Abstract This paper addresses integrated production planning, multi‐quay berth allocation, and quay crane assignment scheduling problems. First, we formulate the problem as a mixed‐integer linear programming (MILP) by extending the relative position formulation presented in the literature to deal with the integrated problem, aiming to maximize the total revenue while considering the demurrage cost. Second, we propose a hybrid MILP‐adaptative large neighborhood search (MILP‐ALNS) approach that we assess using both real‐life instances and randomly generated instances in addition to reported sets from the literature. The results show that the MILP‐ALNS approach performs better than existing iterative local search procedures reported in the literature. In most cases, our approach outperforms CPLEX in terms of time to reach the best solution known while providing comparable solutions.