dc.description.abstract | With the globalization and liberalization of each country’s economy in the world, rapid development of Internet and technology, the raise of customer service level and supply chain concept, the mode of traditional distribution already can’t accomplish demand response rapidly. Therefore, distribution center replaces the mode of traditional distribution. Suppliers’ goods only need to be transported to distribution center, and it will make these goods delivery to each retailers. It removes multi-level channel transshipment and responds market demand rapidly, so that it plays an important role in the supply chain.
This study is used cross-docking as a strategy in the distribution center. It emphasizes that the supplier’s items are assigned to locations of temporary area after the supplier’s items are transported to the distribution center. Pickers who are in the distribution center make operation according to the sequence of order shipment. Finally, fulfill orders are transported to the shipping dock waiting for shipping. Previous studies have pointed out that picking time and cost in order picking operations have an important influence in the distribution center, and the distribution center which uses cross-docking strategy is different to the traditional distribution center. Hence, order picking problem in cross-docking is investigated in this study.
We investigate put-to-light picking problem between tally area and temporary storage area under tally area is multi-block storage locations layout. We propose ‘the selection rule of items in temporary storage area,’ ‘the assignment rule of order storage locations in tally area,’ and ‘picking route planning.’ Our data obtained by the simulation way, and we investigate the total system time to complete the picking operation(TST), total picking time (TPT)and travel distance(TD) in our study environment. Finally, under the performance index of TST and TPT, the best combination is MSD×NTAS×CLG. Under the performance index of TD, the best combination is MOD×NTAS×CLG. | en_US |