Cross Docking

Research Paper ReviewBy:-Sahil Sharma – 15BPI0002Parminder Singh Bhatia – 15BPI0038Inderjit Kumar – 15BPI0049Utkarsh Babbar -15BPI0067Utkarsh Singh – 15BPI00Ajinkya Zanzane – 15BPI0072

What is Cross Docking ?Cross docking is a logistics procedure where products from a supplier or manufacturing plant are distributed directly to a customer or retail chain with marginal to no handling or storage time.  Cross docking takes place in a distribution docking terminal; usually consisting of trucks and dock doors on two (inbound and outbound) sides with minimal storage space.  The name ‘cross docking’ explains the process of receiving products through an inbound dock and then transferring them across the dock to the outbound transportation dock.

Literature Review

• Cross-docking is a practice in logistics of unloading materials from an incoming semi-trailer truck or railroad car and loading these materials directly into outbound trucks, trailers, or rail cars, with little or no storage in between.

• We read the paper of Chen and Sang 2009, in that he formulated the minimization of the total makespan.

• From this, time indexed formulation and polynomial time heuristic of a multi dock truck scheduling problem in a cross-docking centre by Priscila M. Cota, Bárbara M.R. Gimenez, Dhiego P.M. Araújo , Thiago H. Nogueira, Mauricio C. de Souza, Martín G. Ravetti was done and we got the time indexed formula from that paper.

• A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks was solved by Alireza Amini, and Reza Tavakkoli-Moghaddam.

• We read the moth-flame algorithm by Sayedali Mirjalili.

Problem Statement In this paper, we have formulated a Mathematical Model for bi-objective function for finding• Minimum Makespan• Maximum TardinessSo that we can Futher we will solve the given problem with the Moth-flame optimization algorithm.

Mathematical Modal For Objective Function : 1

Mathematical Modal For Objective Function : 1• (1)-Ensuring that in every stage each truck should start

its processing on one and only one ,time slot within the time horizon T

• (2)-Indicates that no of trucks that can be simultaneously process is less than the equal no fo doors present in each stage

• (3)-It represents Cross Docking constrains in which the release date of each outbound truck j2e2 must be greater than or equal to the completion date of each task belonging to its precedence set .The truck change over time is added if any breakdown occurs in the CDC.

• (4)-It ensures that each outbound truck j2e2 starts processing only after its release date.

• (5)-Define the completion time for the outbound trucks.• (6)-Define the makespan , maximum completion time .• (8)-(9)-Specify the domain of each decision variable

Mathematical Modal For Objective Function : 2

Mathematical Modal For Objective Function : 2

• (1)-Aims to minimize the total tardiness of the out bound truck .

• (2)-(3) – Illustrate the balance approach (i.e demonstrating that total no of items received by inbound trucks is equal to total quantity of items sent to outbound trucks).

• (4) - Guarantees not to transfer any item between an inbound and an outbound truck without any relationship with each other.

• (5)-(13) Calculating the completion time of truck .• (14)-Calculating the Total Tardiness .

CONCLUSION

We formed the mathematical modal to minimize the total makespan and maximium tardiness. In future we would use other methods such as moth-flame algorithm to solve this mathematical modal.

References• Chen, F., & Lee, C. Y. (2009). Minimizing the makespan in a two-machine

crossdocking flow shop problem. European Journal of Operational Research, 193, 59–72.

• Chen, F., & Song, K. (2009). Minimizing makespan in two-stage hybrid cross docking scheduling problem. Computers & Operations Research, 36, 2066–2073.

• Priscila M. Cota a , Bárbara M.R. Gimenez a , Dhiego P.M. Araújo a , Thiago H. Nogueira b , Mauricio C. de Souza a , Martín G. Ravetti (2016) . Time-indexed formulation and polynomial time heuristic for a multi-dock truck scheduling problem in a cross-docking centre. Computers & Industrial Engineering 95 (2016) 135–143

• Alireza Amini, Reza Tavakkoli-Moghaddam (2016). A bi-objective truck scheduling problem in a cross-docking center with probability of breakdown for trucks. Computers & Industrial Engineering 96 (2016) 180–191

• Seyedali Mirjalili (2015). Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm. Knowledge-Based Systems 89 (2015) 228–249.