This work studies the problem of cross-docking truck scheduling introduced by (Int J Prod Econ 194:102–112, Serrano et al. 2017), where internal operations including repacking and storing operations are considered. The objective is to minimize the number of inbound trucks which are assigned beyond their contracted time windows. For the special case where only inbound truck arrivals are considered while the outbound truck departures are not ensured, we present some properties of the model and propose a heuristic algorithm called Light Period and Less Options (LPLO) to solve it. For the general case of the problem, due to its NP-hardness, we design a non-trivial Three-phase Greedy (TG) algorithm and the Genetic algorithm (GA). Experimental results with comparison between exact solutions by the CPLEX solver and solutions by the two heuristic algorithms demonstrate that the both proposed heuristic algorithms are of high efficiency in generating optimal or nearly optimal solutions for the considered problem in this work.

这项工作研究了（Int J Prod Econ 194：102–112，Serrano et al。2017）引入的跨码头卡车调度问题，其中考虑了内部操作，包括重新包装和存储操作。目的是最大程度地减少超出合同规定的时间窗口分配的入站卡车的数量。对于仅考虑入站卡车进场而不能确保出站卡车进场的特殊情况，我们介绍了该模型的一些属性，并提出了一种称为“光周期和较少选择权”（LPLO）的启发式算法来解决该问题。对于问题的一般情况，由于其NP硬度，我们设计了一个非平凡的三相贪婪算法（TG）和遗传算法（GA）。