This paper studies the cross-dock truck scheduling problem, which considers the uncertainty of trucks’ arrival and operational times. We introduce a concept named conflict and present a two-stage optimization model, aiming at minimizing the total cost and number of conflicts. Furthermore, an extended model by introducing K-means clustering is presented, for which the performance guarantees are provided to validate its efficiency. A column and constraint generation algorithm, which is proved to converge in a finite number of iterations, is designed to solve the developed models. Extensive numerical experiments are conducted to validate the performance of the developed models and algorithm.

本文研究了跨码头卡车调度问题，该问题考虑了卡车到达和运营时间的不确定性。我们引入了一个名为冲突的概念，并提出了一个两阶段的优化模型，旨在最小化冲突的总成本和数量。此外，提出了一种通过引入K-means聚类的扩展模型，为此提供了性能保证以验证其效率。设计了一种列和约束生成算法，该算法被证明可以在有限的迭代次数内收敛，以解决所开发的模型。进行了广泛的数值实验，以验证所开发的模型和算法的性能。