Queue And Sort Based Algorithm Of Scheduling For Job Of Two-stage Cross-docking

The Cross Docking is a very practical method of operations of logistics warehousing. The scheduling of Cross Docking is a typical of Job Shop Sorting; it is more complex, the research on queuing and sorting are very important foundations of Cross Docking scheduling. The article put forward this view by theory with practice first time.This article studied the Cross Docking on the view of theory first, including the classification of Cross Docking, conditions of the implementations, processes, and advantages.Then studied on sorting, and put forward a view of the best scheduling method of Cross Docking which is Job Shop Sorting firstly. This question can be transfer into scheduling problem with the order of operations and sort of parallel machine problems. The Cross Docking scheduling contains the relationship between the quantity of goods and the quantity of the doors of Cross Docking distribution center. The indoors can influence the costs of the facilities and labors. The more indoors there has, the more costs it will be; on the opposite the costs will be lower. By this viewpoint, this article put forward a method of Queuing theory to solve the optimal indoors, in order to shorting Queuing time and Queuing length by less costs.This article use Queuing theory to study the Cross Docking scheduling, and improve the Johnson method to solve the two stage scheduling problems. And solving the problem by programming, verified the capability of the sorting and queuing theory used to short optimal the responsible time of Cross Docking.