Practical solutions for a dock assignment problem with trailer transportation
We study a distribution warehouse. Trailers need to be assigned to docks for loading or unloading. The purpose is to produce high-quality solutions to large (real-life) instances. We cast the practical setting into a hierarchical bi-objective scheduling problem. We implement four different methods and compare them via computational experiments.
dock assignment multicriteria scheduling branch and bound beam search tabu search