簡易檢索 / 詳目顯示

回結果列表
研究生： 阮氏芳娟
NGUYEN - THI PHUONG QUYEN
論文名稱： 利用兩階段啟發式演算法與動態規劃求解資源受限下組裝線平衡之問題 ─ 以縫紉鞋子之生產線為例
Solving Resource-Constraint Assembly Line Balancing Problem in Footwear Industry
指導教授： 吳建瑋
Chien-Wei Wu
陳建良
James C. Chen
口試委員: 王孔政
Kung-Jeng Wang
學位類別： 碩士
Master
系所名稱： 管理學院 - 工業管理系
Department of Industrial Management
論文出版年： 2013
畢業學年度： 101
語文別： 英文
論文頁數： 52
中文關鍵詞： 裝配生產線的設計 、設備分配 、遺傳算法 、優先級規則為基礎的方法 、啟發式算法 、動態規劃
外文關鍵詞： assembly line design, equipments assignment, genetic algorithm, priority rule-based method, heuristic procedure, dynamic programming.
相關次數： 點閱：330  下載：3 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 本研究主要探討資源受限下組裝線平衡之問題，並以鞋業製程中的縫紉產線為主。鞋業的製程可以依據性別、尺寸、顏色、款式與材質等不同的屬性而分成很多階段。當生產新產品時，生產線就必須符合不影響其限制下重新設計。本研究透過兩個方法並以微軟的Visual C# 來撰寫程式以求解上述的問題。其中，第一種啟發式演算法是以結合基於優先權的方法與基因演算法的兩階段式方法來求解。另一種方法則是利用被歸類為精確演算法的倒推式動態規劃法。此方法是用以彌補啟發式演算法在尋求最佳解過程中的一些限制情況。此外，研究方法的計算結果會針對工作站的數量而言與舊的方法做比較。最後，透過實驗設計得知在中等規模的情況下，本研究提出的方法優於先前的研究。

    This paper considers the assembly line problem in sewing line of footwear manufacturing which is classified into Resource-Constrained Assembly Line Balancing Problem (RCALBP) class. The manufacturing process includes many stages that are specific for each kind of product attribute such as gender, size, color, sole type and material. Whenever a new product is produced, the production line should be re-designed to match with its manufacturing process in terms of without violating related constraints. Two proposed methods are given to solve RCALBP. The first method is two-stage heuristic approach with a combination of priority rule-based method (PRBM) in the first stage and proposed genetic algorithm in the second stage. The second method is backward dynamic programming, which is divided into the group of exact algorithms. This method is developed as a complementary for the first one due to the limitations of the heuristic approaches in the process to find optimal solutions. The two proposed methods are programmed in Microsoft Visual C # Express to solve the mentioned problems. The results are compared to existing research in terms of number of workstation for each mentioned problem. An experimental design is also performed to analyze the problem with respect to the problem size and the precedence shape. The experimental results point out that two proposed method is superior to the existing approaches in terms of objective function for medium-scale problem.

    Content 中文摘要 i Abstract ii Content iii Figure List v Table list vi Chapter 1. Introduction 1 1.1 Background 1 1.2 Objective 3 1.3 Methodology 3 1.4 Organization of Thesis 4 Chapter 2. Literature Review 5 2.1 Assembly Line Balancing Problem 5 2.2 Existing research for ALBP 8 Chapter 3. Problem Statement 9 3.1 Footwear Introduction 9 3.1.1 Components 9 3.1.2 Common process 9 3.2 Characteristics of Line Balancing Problem in footwear-making Sewing Line 11 3.2.1 Workstation arrangement 11 3.2.2 Resource assignment 11 3.2.3 Processing times and parallel stations 11 3.2.4 Frequency 11 3.2.5 Structure of the precedence graph 12 3.3 Problem Assumption and Identification 12 3.3.1 Problem assumption 12 3.3.2 Problem identification 12 3.4 Mathematical Model 13 Chapter 4. The Proposed methods 16 4.1 Dividing work elements 16 4.2 The proposed two-stage heuristic approach 17 4.2.1 Stage 1: Priority Rule-Based Method (PRBM) 17 4.2.2 Stage 2: Proposed Genetic Algorithm 21 4.3 Numerical example 27 4.4 Backward Dynamic Programming 29 4.4.1 A Backward Dynamic Programming Formulation 29 4.4.2 Backward Dynamic Programming Procedure 31 Chapter 5. Experimental result 36 5.1 Computational result 36 5.2 Experimental Analysis 39 5.2.1 Conduct Experiment 39 5.2.2 Analysis Experimental Result 40 Chapter 6. Conclusion and Future Research 44 Reference 45 Appendix 46

    Ağpak, K., & Gokcen, H. (2005). Assembly line balancing: Two resource constrained cases. International Journal of Production Economics, 96, 129-140.
    APICCAPS. (2011). World Footwear 2011 Yearbook. In: Orgal Impressores.
    Bautista, J., & Pereira, J. (2009). A dynamic programming based heuristic for the assembly line balancing problem. European Journal of Operational Research, 194, 787-794.
    Baybars, İ. (1986). A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32, 909–932.
    Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168, 694-715.
    Boysen, N., Fliedner, M., & Scholl, A. (2007). A classification of assembly line balancing problems. European Journal of Operational Research, 183, 674-693.
    Boysen, N., Fliedner, M., & Scholl, A. (2008). Assembly line balancing: Which model to use when? International Journal of Production Economics, 111, 509-528.
    Chen, J.-S., Pan, J. C.-H., & Lin, C.-M. (2008). A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Systems with Applications, 34, 570-577.
    Chen, J. C., Chen, C.-C., Su, L.-H., Wu, H.-B., & Sun, C.-J. (2012). Assembly line balancing in garment industry. Expert Systems with Applications, 39, 10073-10081.
    Joaquı ’n Bautista, Jordi Pereira, (2008). A dynamic programming based heuristic for the assembly line balancing problem. European Journal of Operational Research 194 (2009) 787–794
    Johnson, R.V (1988). Optimally balancing large assembly lines with "FABLE". Management Science, 34, 240-253.
    Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Boston, MA: Addison-Wesley.
    Haupt, R. L., & Haupt, S. E. (2004). Practical Genetic Algorithms: John Wiley & Sons.
    KA, D. J. (1975). An analysis of the behavior of a class of genetic adaptive systems. Ann Arbor: Dissertation, University of Michigan.
    Kao, H.-H., Yeh, D-H, Wang, Y-H. (2011). Resource Constrained Assembly Line Balancing Problem Solved with Ranked Positional Weigth Rule. Review of Economics & Finance, 1923-8401.
    Kao, H. H., & Yeh, D. H. (2006). A new approach for assembly line balancing problems. In The 36th international conference on computers and industrial engineering (pp. 3886-3897).
    Kim, Y. K., Kim, Y. J., & Kim, Y. (1996). Genetic Algorithms for Assembly Line Balancing With Various objectives. Computers ind. Engng, Vol. 30, No. 3, 397-409.
    Marketline. (2012). Footwear Industry Profile: Global. In. London (UK). Meet the Shoe: See what you often can't. In. Foot Locker: Striperpedia.
    Mitchell, M. (1999). An Introduction to Genetic Algorithms. (Fifth printing ed.). Cambridge, Massachusetts*London, England.
    Salveson, M.E. (1955). The assembly line balancing problem. Journal of Industrial Engineering, 6, 18-25.
    Scholl, A., Fliedner, M., & Boysen, N. (2010). Absalom: Balancing assembly lines with assignment restrictions. European Journal of Operational Research, 200, 688-701.
    Scholl, A., & Klein, R. (1997). SALOME: A bidirectional branch and bound procedure for assembly line balancing. INFORMS Journal on Computing, 9, 319-334.
    Tasan, S. O., & Tunali, S. (2008). A review of the current applications of genetic algorithms in assembly line balancing. J Intell Manuf, 19, 49-69.
    Yeh, D.-H., & Kao, H.-H. (2009). A new bidirectional heuristic for the assembly line balancing problem. Computers & Industrial Engineering, 57, 1155-1160.

    QR CODE