.png){kind=icon}
.png){kind=icon}
Return
Syncrolift dry dock scheduling with a capacitated ship transfer system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2025.107138.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Despite the rapidly increasing maintenance demand driven by an aging fleet and the growth of global fleet size, optimizing dry dock operations remains an underexplored area in academic research. This study addresses this gap by focusing on enhancing efficiency through improved dry dock scheduling, aiming to alleviate the growing disparity between maintenance needs and limited dry dock resources. We propose a practical syncrolift dry dock scheduling problem that incorporates a capacitated ship transfer system, which requires determining the optimal sequence of ship maintenance services to minimize total waiting time. A mixed-integer linear programming (MILP) model is developed to effectively tackle the challenges of this problem, particularly the ship transfer system-a critical bottleneck involving the syncrolift and railways-by modeling it as a series of segments with varying capacities and transfer restrictions. The model accommodates the complexities of the scheduling process, such as limited transfer capacity, diverse segment characteristics, bidirectional ship transfer flows, ship compatibility constraints, and sequence-dependent setup times. Recognizing the NP-hard nature of the problem, we introduce a novel column-generation-based heuristic method to solve the MILP model efficiently. The efficacy of the proposed solution method is validated through extensive numerical experiments using real operational data from the NOSCO shipyard. Results demonstrate significant improvements in operational efficiency, with ship waiting times reduced by 32.5% compared to first-come-first-served scheduling solutions.
Keywords:
Syncrolift dry dock scheduling
Ship transfer system
Mixed integer linear programming
Column generation
Heuristic method
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W