Planning in a cross dock network with an operational scheduling overview

Nowadays, cross docking plays an important role in the supply chain networks especially in transportation systems. according to the cross dock system advantages such as reducing transportation costs, lead times, and inventories, scheduling in a cross-dock center would be more complicated by increasing the number of suppliers, customers and product types. considering the cross dock limited capacities (equipment, storage space, work force, and etc.), sometimes it is not possible to deliver the supplier's products to customers in the right times. thus, suppliers pay more tardiness penalties for scheduling problems in the cross dock centers. the current paper aims to propose an integer programming mathematical model that enables the suppliers to choose appropriate transportation paths according to amount of products delivered and moreover considering cross docks scheduling time constraints. in fact, cross dock centers present the list of outbound trucks departure times and suppliers reserve certain capacity based on their tardiness, transportation and inventory holding costs. moreover, in this paper, a lightening search algorithm (lsa) is developed to solve the proposed model. additionally, to develop the solving procedure, a heuristic algorithm is proposed and compared with the lsa.