{"title":"带容量船舶转运系统的同步干船坞调度","authors":"Hao Guan, Mengtong Wang, Qiang Meng","doi":"10.1016/j.cor.2025.107138","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"182 ","pages":"Article 107138"},"PeriodicalIF":4.1000,"publicationDate":"2025-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Syncrolift dry dock scheduling with a capacitated ship transfer system\",\"authors\":\"Hao Guan, Mengtong Wang, Qiang Meng\",\"doi\":\"10.1016/j.cor.2025.107138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>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.</div></div>\",\"PeriodicalId\":10542,\"journal\":{\"name\":\"Computers & Operations Research\",\"volume\":\"182 \",\"pages\":\"Article 107138\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2025-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Operations Research\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305054825001662\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825001662","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Syncrolift dry dock scheduling with a capacitated ship transfer system
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.
期刊介绍:
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.