In this paper the authors deal with the scheduling of inbound and outbound trucks to the available inbound and outbound doors at a cross dock facility. They assume that all trucks served at the facility need to meet several deadlines for deliveries and pick-ups and thus request a departure time window from the facility, penalizing the facility operator, on a unit of time basis, if that deadline is not met. To solve the resulting problem with reasonable computational effort, a memetic algorithm is developed and a number of computational examples show the efficiency of the proposed solution algorithm and the advantages of scheduling inbound and outbound trucks simultaneously, as opposed to sequentially. Copyright

Additional Metadata
Keywords Cross-docking, Heuristics, Memetic algorithms, Optimization methods, Truck scheduling
Persistent URL dx.doi.org/10.4018/ijisscm.2013070102, hdl.handle.net/1765/71606
Journal International Journal of Information Systems and Supply Chain Management
Citation
Golias, M.M, Saharidis, G.K.D, Ivey, S, & Haralambides, H. (2013). Advances in truck scheduling at a cross dock facility. International Journal of Information Systems and Supply Chain Management, 6(3), 40–62. doi:10.4018/ijisscm.2013070102