English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49287/83828 (59%)
Visitors : 7154227      Online Users : 81
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/80365


    Title: Mathematical Programming Model for Type-I Two-sided Assembly Line Balancing Problem
    Authors: Yeh, Din-Horng;Huang, Sih-Ting
    Contributors: 淡江大學企業管理學系
    Keywords: Type-I assembly line balancing;Two-sided;Mathematical programming
    Date: 2012-12
    Issue Date: 2013-01-23 11:28:55 (UTC+8)
    Abstract: Two-sided assembly line balancing problem (TALBP) is commonly seen in the industries of assembling large-size products; typical examples include automobiles, buses, trucks, etc. Unlike the traditional assembly lines, assembly tasks in TALBP must be processed on both sides of the assembly line. Only limited researches discuss the issues of TALBP. We consider in this study the so-called type-I TALBP (TALBP-I), and the objective of this study is to propose a mathematical programming model to find the optimal task assignment of TALBP-I. An illustrative example is given to show the effectiveness of the model. We also show that, through numerical experiments, the model can be extended to solve type-II TALBP (TALBP-II).
    Two-sided assembly line balancing problem (TALBP) is commonly seen in the industries of assembling large-size products; typical examples include automobiles, buses, trucks, etc. Unlike the traditional assembly lines, assembly tasks in TALBP must be processed on both sides of the assembly line. Only limited researches discuss the issues of TALBP. We consider in this study the so-called type-I TALBP (TALBP-I), and the objective of this study is to propose a mathematical programming model to find the optimal task assignment of TALBP-I. An illustrative example is given to show the effectiveness of the model. We also show that, through numerical experiments, the model can be extended to solve type-II TALBP (TALBP-II).
    Relation: The IEEE International Conference on Industrial Engineering and Engineering Management
    Appears in Collections:[企業管理學系暨研究所] 會議論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback