Crossdock truck scheduling with time windows: earliness, tardiness and storage policies
This article proposes to simultaneously plan inbound and outbound truck arrivals and departures in a cross-docking platform, as well as the internal pallet handling. The objective is to minimize both the total number of pallets put in storage and the dissatisfaction of the transportation providers, by creating a truck schedule as close as possible to the wished schedule they communicate in advance. The problem is modeled with an integer program tested on generated instances to assess its performance, especially regarding the computation time. The problem is proven to be np-hard in the strong sense. Since the execution takes too long to be used on a daily basis by platform managers, three heuristics are also proposed and tested. Two are based on integer programs solved sequentially, the third one is a tabu search in which the storage part of the objective function is evaluated by a maximum flow model in a graph. Numerical experiments show in which conditions each heuristic performs best, which can help choosing a solution method when confronted to a real-life problem.
KeywordsCross-docking Crossdock truck scheduling Integer programming Heuristics
G-SCOP is partner of the LabEx PERSYVAL-Lab (ANR–11-LABX-0025).
- Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms and applications. Upper Saddle River, NJ: Prentice Hall.Google Scholar
- Baud-Lavigne, B., Bassetto, S., & Agard, B. (2014). A method for a robust optimization of joint product and supply chain design. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-014-0908-5.
- Fazel Zarandi, M. H., Khorshidian, H., & Shirazi. M. A. (2014). A constraint programming model for the scheduling of JIT cross-docking systems with preemption. Journal of Intelligent Manufacturing. doi: 10.1007/s10845-013-0860-9.
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: WH Freeman.Google Scholar
- Golias, M. M., Ivey, S., Haralambides, H. E., & Saharidis, G. K. D. (2010). Maximizing throughput and minimizing tardiness and earliness at a cross dock facility: Biobjective formulation. Transportation Research Board 89th Annual Meeting (pp. 1–14). Washington DC.Google Scholar
- Lim, A., Ma, H., & Miao, Z. (2006a). Truck dock assignment problem with operational time constraint within crossdocks. In M. Ali & R. Dapoigny (Eds.), Advances in applied artificial intelligence, lecture notes in computer science, (Vol. 4031, pp. 262–271). Berlin, Heidelberg: Springer.Google Scholar
- Lim, A., Ma, H., & Miao, Z. (2006b). Truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks. In M. Gavrilova, O. Gervasi, V. Kumar, C. Tan, D. Taniar, A. Laganá, Y. Mun, & H. Choo (Eds.), Computational science and applications, lecture notes in computer science (Vol. 3982, pp. 688–697)., Berlin, Heidelberg: Springer.Google Scholar
- McWilliams, D. L., Stanfield, P. M., & Geiger, C. D. (2008). Minimizing the completion time of the transfer operations in a central parcel consolidation terminal with unequal-batch-size inbound trailers. Computers & Industrial Engineering, 54(4), 709–720.Google Scholar
- McWilliams, D. L. (2009a). A dynamic load-balancing scheme for the parcel hub-scheduling problem. Computers & Industrial Engineering, 57(3), 958–962.Google Scholar
- Napolitano, M. (2000). Making the move to cross docking: A practical guide to planning, designing and implementing a cross dock operation. Oak Brook: Warehousing Education & Research Council.Google Scholar
- Yu, V. F., Sharma, D., & Murty, K. G. (2008). Door allocations to origins and destinations at less-than-truckload trucking terminals. Journal of Industrial and Systems Engineering, 2(1), 1–15.Google Scholar
- Zhu, Y. R., Hahn, P. M., Liu, Y., Guignard, M. (2009). New approach for the cross-dock door assignment problem. In XLI Brazilian Symposium on Operations Research. Porto Seguro, Brazil.Google Scholar