We consider the truck scheduling problem at a cross docking terminal with many inbound and outbound doors, under the assumption of constant handling time for all the trucks, the objective being to minimize the completion time of the whole process. We propose a mathematical model together with a Lagrangian Relaxation scheme. We discuss the structural properties of the relaxed problem and derive a Lagrangian heuristic able to compute, at the same time, good feasible solutions and increasing lower bounds. The numerical results show that the Lagrangian decomposition is a promising approach to the solution of such problems.
Lagrangian relaxation Scheduling Heuristics
This is a preview of subscription content, log in to check access.
Boysen, N., Fliedner, M.: Cross dock scheduling: classification, literature review and research agenda. Omega Int. J. Manage. S. 38(6), 413–422 (2010)CrossRefGoogle Scholar
Buijs, P., Vis, I.F., Carlo, H.J.: Synchronization in cross-docking networks: a research classification and framework. Eur. J. Oper. Res. 239(3), 593–608 (2014)CrossRefGoogle Scholar
Chiarello, A., Gaudioso, M., Sammarra, M.: Truck synchronization at single door cross-docking terminals. OR Spectr. 40(2), 395–447 (2018)MathSciNetzbMATHGoogle Scholar
Van Belle, J., Valckenaers, P., Cattrysse, D.: Cross-docking: state of the art. Omega Int. J. Manage. S. 40(6), 827–846 (2012)CrossRefGoogle Scholar