期刊文献+

基于网络技术的可视化拣选方案及其性能分析

A network-based visual order-picking scenario and its performance analyses in AS/RS
下载PDF
导出
摘要 提出一种利用计算机通信网络和触摸屏技术的可视化拣选操作方案 ,它配合存储货位分配策略和执行批量拣选作业的优化顺序 ,可以提高自动化立体仓库中载人拣选作业的工作效率 ,增加仓库的吞吐率。在给出这种新方案的实现框架之后 ,分析了该方案的性能模型 ,并对具有动态作业插入时的系统性能进行了分析与比较。 This paper proposes a new kind of visual scenario for man on board order picking in automated storage/retrieval system (AS/RS) using network technology and panel pc. By using the storage assignment policies and sequencing algorithms, we can improve the performance of the man on board order picking method, increasing the throughput capacity of AS/RS. After introducing the framework of this new method, we present an analytical model and analyze the system performance for the case of using dynamic job inserting.
出处 《铁道学报》 EI CAS CSCD 北大核心 2002年第2期59-63,共5页 Journal of the China Railway Society
基金 教育部高等学校骨干教师资助计划项目资助 [教技司(2 0 0 0 ) 1 4 3-铁 2 ] 上海市教委重点学科课题
关键词 自动存储/检索系统 可视化 拣选操作 巷道堆垛机 automated storage/retrieval system (AS/RS) visualization order picking stacker
  • 相关文献

参考文献10

  • 1[1]Cormier G. A Brief Survey of Operations Research Models for Warehouse Design and Operation[J]. CORS-SCRO Bulletin, University of Moncton, 1997, (8):15-20.
  • 2[2]Heskett J L. Cube-per-order index: A key to warehouse stock location[J]. Transportation and Distribution Management, 1963, (3):27-31.
  • 3[3]Hausman W H, et al. Optimal Storage Assignment in Automated Warehousing Systems[J]. Management Science, 1976,22(6):625-638.
  • 4[4]Graves S C, et al. Storage/Retrieval Interleaving in Automated Warehousing Systems[J]. Management Science,1977,23 (9):935-945.
  • 5[5]Karp R. Reducibility Among Combinatorial Problems[A]. In: Complexity of Computer Computations[C], Miller R, Thatcher J. (eds.), Plenum Press, New York: 1972. 85-104.
  • 6[6]Papadimitriou C H. The Euclidean Traveling Salesman Problem is NP-Complete[J]. Theoretical Computer Science, 1977,4(3):237-244.
  • 7[7]Golden B, et al. Approximate Traveling Salesman Algorithms[J]. Operations Research, 1980,28(3):693-711.
  • 8[8]Bozer Y A, Schorn C, Sharp P. Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem[J]. IIE Transactions, 1990, 22(3):238-54.
  • 9[9]Goetschalckx M P. Storage and Retrieval Policies for Efficient Order Picking[D]. Ph.D. Dissertation, Georgia Institute of Technology, Atlanta, GA, 1983.
  • 10[10]Boyer Y A, White John A. Travel Time Models for Automated Storage/Retrieval Systems[J]. IIE Transactions, 1984, 16(4):329-338.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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