Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.