Problema de sequenciamento de caminhões em centros de Crossdocking com múltiplas docas

Abstract

This dissertation undertakes the study of truck scheduling in a crossdocking station, with multiple docks in parallel. The problem is formulated as a two-stage hybrid owshop problem, minimizing the makespan, and subject to crossdocking constraints. These constraints forbid a job in the second stage to be processed until the conclusion of its precedent jobs. We proposed a time-indexed mixed integer linear programming model able to solve small instances through a commercial solver. For moderate and large size instances, four constructive heuristics are proposed and tested. Computational experiments were performed to compare these results with those reported in the literature.