arXiv:2611.24030v1 Announce Type: new Abstract: We consider an electric vehicle charging scheduling problem for long-haul freight transport. To mitigate unforeseen waiting times caused by congestion and limited charger capacity, we consider a coordinated scheduling approach that prioritizes scalable, computationally efficient scheduling for ongoing or online operations. We formulate the problem as a set partitioning model and develop a column generation framework with a label-correcting algorithm to solve it efficiently. We assess the scalability of our algorithm through both theoretical complexity analysis and empirical measurements, highlighting the role of feasibility and dominance pruning in limiting label growth. Finally, using freight telematics data from Sweden, we show that the proposed method computes optimized schedules for realistic instances with 1000 vehicles within seconds and reduces vehicle operation downtime by 78.6% compared to uncoordinated scheduling.