期刊文献+

基于T物流中心的存储策略与补货作业优化

Storage Strategy and Replenishment Operation Optimization based on T Logistics Center
下载PDF
导出
摘要 近几年我国经济实现了质的飞跃,尤其在电商方面的成就举世瞩目,电商的发展离不开物流的支撑。随着电商平台、消费者对物流行业的要求越来越高,如何提高速度、降低成本、保证质量成为物流企业的首要任务。在整个物流运作中,仓储成本占物流总成本的1/3,因此高效合理的仓储管理策略对物流企业的发展至关重要。文中基于T物流中心存储与补货作业概况,运用双标准的ABC分类管理法和商品相关性分析法,对该物流中心的存储策略和补货作业进行优化设计,对于优化物流中心的运作成本、提高运作效率提供一定的借鉴和参考。 In recent years,China’s economy has made a qualitative leap,especially in e-commerce,the development of e-commerce can not be separated from the support of logistics. With the ecommerce platform,consumers have higher and higher requirements for the logistics industry. How to improve the speed,reduce costs and ensure quality has become the primary task of logistics enterprises. In the whole logistics operation,warehousing cost accounts for 1/3 of the total logistics cost,so efficient and reasonable warehousing management strategy is very important to the development of logistics enterprises. Based on the general situation of storage and replenishment operations in T logistics center,this paper applies the double standard ABC classification management method and commodity correlation analysis method to the logistics center. The optimal design of storage strategy and replenishment operation provides a certain reference and reference for optimize operation cost of logistics center and improving the operation efficiency.
作者 姚赛 YAO Sai(School of Business Administration,Fujian Jiangxia University,Fuzhou 350108,China)
出处 《物流工程与管理》 2020年第3期58-61,共4页 Logistics Engineering and Management
关键词 存储策略 补货作业 ABC分类 相关性 storage strategy replenishment operation ABC classification correlatio
  • 相关文献

参考文献3

二级参考文献23

  • 1吴建中.图书馆VS机构库——图书馆战略发展的再思考[J].中国图书馆学报,2004,30(5):5-8. 被引量:124
  • 2都平平,李明.专题数据库的数据挖掘与知识管理——以《中国煤矿事故数据库》为例[J].图书馆杂志,2006,25(2):14-15. 被引量:7
  • 3朱江,时小鸿,姜恩波,陈漪红,鄢小燕.中国科学院科技会议文献资源库的研建[J].现代图书情报技术,2006(10):1-5. 被引量:4
  • 4Lee M K, Kim S Y. Scheduling of storage/retrieval orders under a just-in-time environment[J].International Journal of Production Research, 1995,33 (12) : 3331-3348.
  • 5Won J, Olafsson S. Joint order batching and order picking in warehouse operations [J]. International Journal of Production Research, 2005,43(7): 1427- 1442.
  • 6Lageweg B J, Lenstra J K, Rinnooy Kan A H G. Minimizing maximum lateness on one machine: Computational experience and some applications [J]. Statist. Neerlandica, 1976, (30) : 25-41.
  • 7Jeroen P Van Den Berg. Multiple order pick sequencing in a carousel system: A solvable case of the rural postman problem [J].The Journal of the Operational Research Society, 1996,47(12) : 1504-1515.
  • 8Bozer Y A, Schorn E C, Sharp G P. Geometric approaches to solve the Chebyshev traveling salesman problem [J]. IIE Transactions, 1990,22 (3):238-254.
  • 9Michael R Garey, David S Johnson. Computers and intractahility:A guide to the theory of NP-Completeness [R]. W. H. Freeman and Company,1979.
  • 10Ranan B Banerii. Artificial intelligence: a theoretical approach[M]. New York : North Holland, 1980.

共引文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部