簡易檢索 / 詳目顯示

研究生: 沈唯凱
Shen-wei Kai
論文名稱: 考慮阻塞時間在零散式揀貨系統下之週期時間研究
A study of cycle time with congestion considerations for a pick-and-pass system
指導教授: 潘昭賢
Chao-hsiew Pan
口試委員: 許總欣
Tsung-shin Hsu
蕭裕正
Hsiao,yu-Cheng
學位類別: 碩士
Master
系所名稱: 管理學院 - 工業管理系
Department of Industrial Management
論文出版年: 2009
畢業學年度: 97
語文別: 英文
論文頁數: 61
中文關鍵詞: 揀貨作業儲位指派倉儲管理單一揀貨員等候網路零散式揀貨
外文關鍵詞: order picking, storage assignment, warehouse management, one picker operations, queueing network, pick-and-pass
相關次數: 點閱:260下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

對於提昇倉儲管理的效率而言,揀貨作業是最重要的關鍵因素。過去對於揀貨作業的研究,大多考量單一揀貨人員或是多個揀貨人員的行走距離與時間。對於實際的倉儲系統而言,揀貨作業不但包含揀貨時間以及因阻塞而造成揀貨箱在等待處理的等待時間,如果僅考慮揀貨人員之行走距離或時間並無法精確評估揀貨作業的績效,必須加入揀貨時間與揀貨箱的等待時間,才能有效反映整體的作業效率。本研究視揀貨模式為一個等候網路,並考慮在零散式揀貨系統下的單一揀貨人員的行走時間,揀貨時間與揀貨箱等待處理的時間,其平均加總為此揀貨模式的訂單週期循環時間。本研究利用eM-plant模擬軟體模擬此倉儲模式,並針對三種儲位指派進行模擬測試,以用來比較所提出的分析方法績效,而結果顯示絕對差異皆小於2%。


Order picking is one of the most important key factors for an efficient warehouse management. Most of previous research in order picking considered only travel distance and time of single-picker or multiple-pickers. However, for a real warehouse system, order picking includes picking time as well as waiting time because of the congestion to cause the container has to wait be processed. For this reason, consider only about the travel distance or travel time of the picker, it may not evaluation of the efficiency for the picking operations. It must join together with picking time and waiting time for the container.
  The purpose of this research is to study the single-picker’s travel time, picking time and the effect of congestion on the order picking operations in a pick-and-pass system where the picking follows the walk-and-pick method of order retrieval with sequential one-way travel. The picking model can be treated as an open Queueing Network and this research can compute an order mean cycle time. A simulation model is proposed and developed to implement this analytically method using eM-plant software to test three storage assignment types. The results show that the absolutely differences between the analytically model and the simulation results were below 2 %.

摘要 I ABSTRACT II ACKNOWLEDGEMENTS III CONTENTS IV TABLE INDEX V FIGURE INDEX VI CHAPTER 1 Introduction 1 CHAPTER 2 Liturature Review 4 CHAPTER 3 Model Statement And Solution Methods 10 3.1 The Warehouse Model 10 3.1.1 Warehouse System and Assumption 10 3.2 Notation 12 3.3 Evaluation of Service Time 14 3.3.1 Evaluation of Travel Time 14 3.3.2 Evaluation of Picking Time 18 3.3.3 Evaluation of Service Time 19 3.4 Queueing Network of Single Class Network 20 3.5 Diffusion Approximation 23 3.6 Computational Algorithm 26 CHAPTER 4 Experimental Design And Simulation Model 29 4.1 Description of The Warehouse Layout 29 4.2 Computation Results 41 4.3 The Simulation Model 50 4.4 Results of Simulation 51 4.5 Sensitivity Analyses 52 CHAPTER 5 Conclusion And Suggestion In The Future 55 REFERENCES 57

[1] Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H. and Tanchoco, J.M.A. 2003. Facilities Planning, John Wiley & Sons, Hoboken, NJ.
[2] Maloney D., 2000. Seeing the light. Modern Materials Handling, August, 49-53.
[3] Gunter B., Stefan G., Hermann de M. and Kishor S.T., 2006. Queueing Network and Markov Chain. John Wiley & Sons, Hoboken, NJ, 878 pages, 321-324, 326-329, 463-467.
[4] Van den Berg, J.P., 1999. A literature survey on planning and control of warehousing systems. IIE Transactions, 31(8), 751-762.
[5] Roodbergen, K.J., 2001. Layout and routing methods for warehouses, Ph.D. Thesis, Erasmus Research Institute of Management, RSM Erasmus University, the Netherlands.
[6] Le-Duc, T., 2005. Design and control of efficient order picking processes, Ph.D. Thesis, Erasmus Research Institute of Management, RSM Erasmus University, the Netherlands.
[7] Gu, J., Goetschalckx, M. and McGinnis, L.F., 2007. Research on warehouse operation: A comprehensive review. European Journal of Operational Research, 177(1), 1-21.
[8] Petersen, C.G. and Gerald, A., 2004. A comparison of picking, storage, and routing policies in manual order picking. International Journal of Production Economics, 92, 11-19.
[9] Benjamin P., Bart V. and Denis D., 2003. Dynamic ABC storage policy in erratic demand environments. Jurnal TeknikIndustri Vol. 5, No. 1, pp. 1-2.
[10] Kallina, C. and Lynn, J., 1976. Application of the cube-per-order index rule for stock location in distribution warehouse. Interfaces, 7 (1), 37-46.
[11] Gibson, D. R., and Sharp, G. P., 1992. Order batching procedures. European Journal of Operational Research, 58, 57-67.
[12] Frazelle, E.H., 1989. Stock location assignment and order picking productivity. PhD thesis.
[13] Petersen, C.G., Aase, G.. and Heiser, D.R., 2004. Improving order-picking performance through the implementation of class-based storage. International Journal of Physical Distribution and Logistics Management, 34(7), 534-544.
[14] Gibson, D. R. and Sharp, G. P., 1992. Order batching procedures. European Journal of Operational Research, 58, 57- 67.
[15] Ratliff, H. D. and Rosenthal, A. S., 1983. Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations Research, 31 (3), 507- 521.
[16] Goetschalckx, M. and Ratliff, H. D., 1988. Order picking in an aisle. IIE Transactions, 20, 53- 62.
[17] Hall, R.W., 1993. Distance approximations for routing manual pickers in a warehouse. IIE Transactions 25 (4), 76–87.
[18] Petersen, C.G. and Schmenner, R.W., 1999. An evaluation of routing and volume-based storage policies in an order picking operation. Decision Sciences 30 (2), 481–501.
[19] Petersen, C.G., 1997. An evaluation of order picking routing policies. International Journal of Operations & Production Management 17 (1), 1096–1111.
[20] Roodbergen, K.J. and Koster, R., 2001. Routing methods for warehouses with multiple cross aisles. International Journal of Production Research 39 (9), 1865–1883.
[21] Gademann, N., Van den Berg, J.P. and Van der Hoff, H.H., 2001. An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE transactions, 33, 385-398.
[22] Gademann, N. and Van de Velder, S., 2005. Order batching to minimize total travel time in a parallel-aisle warehouse. IIE transactions, 37(1), 63-75.
[23] Elsayed, E.A. and Stern, R.G., 1983. Computerized algorithms for order processing in automated warehousing systems. International Journal of Production Research, 21(4), 579-586.
[24] Hwang, H., Baek, W. and Lee, M.K., 1988. Clustering algorithms for order picking in an automated storage and retrieval system. International Journal of Production Research, 26(2), 189-201.
[25] Gibson, D.R. and Sharp, G.P., 1992. Order batching procedures. European Journal of Operational Research, 58(1), 57-67.
[26] Pan, C.H. and Liu, S.Y., 1995. A comparative study of order batching algorithms. Omega International Journal of Management Science, 23(6), 691-700.
[27] Elsayed, E.A. and Unal, O.L., 1989. Order batching algorithms and travel-time estimation for automated storage/retrieval systems. International Journal of Production Research, 29, 1097-1114.
[28] De Koster, M.B.M., Van De Poort, E.S. and Wolters, M., 1999. Efficient order batching methods in warehouses. International Journal of Production Research, 37(7), 1479-1504.
[29] Chew, E. and Tang, L. C., 1999. Travel time analysis for general item location assignment in a rectangular warehouse. European Journal of Operational Research, 112(3), 582-597.
[30] Le-Duc, T. and De Koster, M.B.M., 2007. Travel time estimation and order batching in a 2-block warehouse. European Journal of Operational Research, 176(1), 374-386.
[31] Elsayed, E.A., 1981. Algorithms for optimal material handling in automatic warehousing systems. Int. J. Prod. Res., 19, 525–535.
[32] Gibson, D.R. and Sharp, P., 1992. Order batching procedures. European Journal of Operations Research, 58, 57–67.
[33] Rosenwein, M.B., 1996. A comparison of heuristics for the problem of batching orders for warehouse selection. Int. J. Prod. Res., 34, 657–664.
[34] Elsayed, E.A., Lee, M.-K., Kim, S. and Scherer, E., 1993. Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Int. J. Prod. Res., 31, 727–738.
[35] Daganzo, C.F., 1984. “The length of tours in zones of different shapes”, Transportation Research, Vol. 18B No. 2, pp. 135-45.
[36] Gray, A.E., Karmarkar, U.S. and Seidmann, A., 1992. “Design and operation of an order-consolidation warehouse: model and application”, European Journal of Operational Research, Vol. 25 No. 4, pp. 76-87.
[37] Francis, R.L., 1967. “On some problems of rectangular warehouse design and layout”, The Journal of Industrial Engineering, Vol. 18, pp. 595-04.
[38] Petersen, C.G., 1997. “An evaluation of order picking policies for mail order companies”, Production and Operations Management, Vol. 9 No. 2, pp. 481-501.
[39] Malmborg, C.J., 1995. Optimization of Cubic-per-Order Index layout with zoning constraints. International Journal of Production Research, 33(2), 465-482.
[40] Petersen, C.G. and Gerald, A., 2002. Considerations in order picking zone configuration. International Journal of Operations & Production Management, 27, 793-805.
[41] Jewkes, E., Lee, C. and Vickson, R., 2004. Product location, allocation and server home base location for an order picking line with multiple servers. Computers & Operations Research, 31, 623-626.
[42] Jane, C.C. and Laih, Y.W., 2005. A clustering algorithm for item assignment in a synchronized zone order picking system. European journal of operational research, 166, 489-496.
[43] Le-Duc, T. and De Koster, M.B.M., 2005. On determine the optimal number of zones in a pick-and-pack order picking system. Report, Erasmus Research Institute of Management, RSM Erasmus University, the Netherlands.
[44] Jane, C.C. and Laih, Y.W., 2005. A clustering algorithm for item assignment in a synchronized zone order picking system. European Journal of Operational Research, 166, 489-496.
[45] De Koster, R., 1994. Performance approximation of pick-to-belt order picking systems. European Journal of Operational Research, 72, 558-573.
[46] Yu M. and De Koster R., 2007. Performance approximation and design of pick-to-pass order picking systems, Ph.D. Thesis, Erasmus Research Institute of Management, RSM Erasmus University, the Netherlands.
[47] Whitt, W., 1983. The queuing network analyzer. The Bell System Technical Journal, 62(9), 2779-2815.
[48] Capone, G., Costlow, D., Grenoble, W.L. and Novack, R.A., 2004. The RFID-Enabled Warehouse, SAP University Thought Leadership Supply Chain Paper.
[49] H. Kobayashi., 1974. Application of the Diffusion Approximation to Queueing Networks, Part 1: Equilibrium Queue Distributions. Journal of the ACM, 21(2):316-328, 463-465.
[50] M. Reiser and H. Kobayashi., 1974. Accuracy of the Diffusion Approximation for Some Queueing Systems. ZBM Journal of Research and Development, 18(2):110-124, 463-465, 467, 470.
[51] E. Gelenbe., 1975. On Approximate Computer System Models. Journal of the ACM, 22(2):261-269, 464-465, 601.
[52] U. Mitzlaff., 1997. Diffusions approximation von Warteschlangensystemen. Dissertation, Technical University Clausthal, Germany, 463-464.
[53] Jason Chao-Hsien Pan* and Ming-Hung Wu, 2008. A study of storage assignment problem for an order picking line in a pick-and-pass warehousing system. Computer and Industrial Engineering. Inpress.
[54] EK-Peng Chew and Loon Ching Tang, 1999. Travel time analysis for general item location assignment in a rectangular warehouse. European Journal of Operational Research, 112, 582-59.

QR CODE