Maximizing Throughput and Minimizing Tardiness and Earliness at a Cross Dock Facility: Biobjective Formulation

In this paper we deal with the scheduling of inbound and outbound trucks (ITs and OTs) to the available inbound and outbound doors at a cross dock facility. We assume that an OT cannot start service until all the ITs carrying cargo destined for that OT have finished unloading. We further assume that both the ITs and OTs need to meet several deadlines for deliveries and pick-ups and thus request a departure time window from the facility, penalizing the facility operator if that deadline is not met. Assuming that departure deadlines are in the form of a time window is more realistic than to assume deadlines as a point in time. Furthermore, penalization of both early and tardy departures is compatible with the just-in-time (JIT) philosophy, where both service types should be discouraged. The truck scheduling policy presented in this paper has two objectives: a) maximization of the facility’s total throughput, measured as the total service time for all trucks served at the facility, and b) minimization of costs incurred by the cross dock facility operator from early and tardy departures of trucks at both the inbound and outbound doors. To solve the resulting problem with reasonable computational effort, an evolutionary based heuristic is proposed and a number of computational examples are presented to evaluate the efficiency of the proposed resolution algorithm.


  • English

Media Info

  • Media Type: DVD
  • Features: Figures; References;
  • Pagination: 14p
  • Monograph Title: TRB 89th Annual Meeting Compendium of Papers DVD

Subject/Index Terms

Filing Info

  • Accession Number: 01158843
  • Record Type: Publication
  • Report/Paper Numbers: 10-1308
  • Files: BTRIS, TRIS, TRB
  • Created Date: Jan 25 2010 10:34AM