Authors: Wooyeon Yu
Addresses: Department of Industrial and Management Engineering, Myong Ji University, 116 Myongji-ro, Cheoin-gu, Yongin, Gyeonggi-do, 449-728, Korea
Abstract: The objective of this study is to find the best docking sequences for trucks at each receiving and shipping dock as well as assignments of inbound and outbound trucks to docks to minimise the makespan of the cross docking system with multiple docks. The unloading sequences of products from inbound trucks, product routing, and routing sequences are also determined simultaneously. To solve the cross docking problem, two approaches - a mathematical model and two heuristic algorithms - were developed. Due to time complexity of the mathematical model, the lower bound of the makespan is developed to compare the performance of the heuristics. The results shows that the makespans found from the heuristics are very close to the lower bounds of the problems.
Keywords: cross docking; makespan; truck scheduling; product routing; multiple docks; docking sequences; unloading sequences; product routing; routing sequences; mathematical modelling; heuristics.
International Journal of Shipping and Transport Logistics, 2015 Vol.7 No.2, pp.174 - 196
Available online: 19 Feb 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article