Best Bordering Algorithm for complexly shaped Blocks in Shipbuilding

This paper proposes the best bordering algorithm for optimizing the placement of complexly shaped blocks in shipbuilding. The best bordering algorithm primarily measures the bordering length between the blocks and the workplace, and selects the placement position with the maximum bordering length to achieve a dense arrangement of blocks in the workplace and obtain the optimal arrangement plan. By using the best bordering algorithm, it ensures that each block entering the workplace is placed in the most adjacent position to other blocks, which maximizes the utilization rate of the workplace. When compared with the existing lowest center-of-gravity method, we observe that the overall makespan of the scheduling plan obtained by the best bordering algorithm is shorter and the average utilization rate of the workplace is higher, thus highlighting its superiority. This algorithm can be applied to solve actual production planning and scheduling problems in the industry to improve resource utilization rates and maximize efficiency.