中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51661
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41661997      Online Users : 1946
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/51661


    Title: A concurrent solution for intra-cell flow path layouts and I/O point locations of cells in a cellular manufacturing system
    Authors: Ho,YC;Liao,TW
    Contributors: 工業管理研究所
    Keywords: GROUP-TECHNOLOGY;FACILITY LAYOUT;MACHINE LAYOUT;BLOCK LAYOUT;GENETIC ALGORITHM;CONTOUR DISTANCE;DESIGN;INPUT;TREE
    Date: 2011
    Issue Date: 2012-03-27 19:02:01 (UTC+8)
    Publisher: 國立中央大學
    Abstract: In this paper, we study the I/O (Input/Output) point location problem and the intra-cell flow path layout problem of cells in a cellular manufacturing system. Traditional approaches have often solved these two problems as separate problems, despite they are mutually affected. As a result, the results obtained by traditional approaches may not be as desirable as expected. In this study, we propose a layout procedure that can solve these two problems concurrently, so that the sum of the inter-cell flow distance and the intra-cell flow distance can be minimized. We assume cells have been arranged along a straight-line inter-cell flow path. Furthermore, the machines' positions on each cell's intra-cell flow path have been determined, but the intra-cell flow path of each cell has not been placed on the shop floor yet. We also assume the configuration of intra-cell flow paths is serpentine. The proposed layout procedure classifies the flow distance incurred by inter-cell flow into five types and minimizes them with different solution procedures containing various linear programming models. The proposed layout procedure has four phases. At the first phase, we find each cell's input and output points on the inter-cell flow path by considering only the inter-cell flow distance. At the second phase, we find the input and outpoint points on each cell's intra-cell flow path by considering only the intra-cell flow distance. At the third phase, we use the points found in the previous two phases as references to help us correctly orient and arrange each cell's intra-cell flow path on the shop floor. Finally, at the fourth phase, we find the accurate the input points and output points on each cell's intra-cell flow path and the inter-cell flow path by simultaneously considering the inter-cell and the intra-cell flow distance. We use an example to illustrate the proposed layout procedure. The results of the example show that the proposed layout procedure can effectively find each cell's I/O point locations and intra-cell flow path layout by considering both intra-cell and inter-cell flow distance at the same time. (C) 2011 Elsevier Ltd. All rights reserved.
    Relation: COMPUTERS & INDUSTRIAL ENGINEERING
    Appears in Collections:[Graduate Institute of Industrial Management] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML696View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明