Cell formations in the uni-directional loop and bi-directional linear material flow facilities
博士 === 國立成功大學 === 工業管理學系 === 89 === Abstract This study is concerned with jointed cell clustering-layout problem in which the cell formation and the intercell layout are determined simultaneously. The machine cells are to be located along two popular material handling facilitie...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/88355205683594239922 |
id |
ndltd-TW-089NCKU0041050 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-089NCKU00410502016-01-29T04:23:54Z http://ndltd.ncl.edu.tw/handle/88355205683594239922 Cell formations in the uni-directional loop and bi-directional linear material flow facilities 考慮物料搬運特性之單元製造系統設計--單向單迴圈與雙向直線佈置 CHIH-PING CHIANG 蔣治平 博士 國立成功大學 工業管理學系 89 Abstract This study is concerned with jointed cell clustering-layout problem in which the cell formation and the intercell layout are determined simultaneously. The machine cells are to be located along two popular material handling facilities, i.e. the unidirectional unicyclic loop network and the linear single-row bi-directional layout. The decision parameters include demand data and routing sequence of parts, processing time, unique and duplicated machine types, and machine capacities or workload. The objective of the joint problem is to minimize the actual intercell flow cost, instead of the typical measure that minimizes the number of intercell movements. A three-phase heuristic approach is proposed to solve the jointed problem when the unidirectional loop network is considered. In this approach, the intercell flow cost function is reformulated as a weighted criterion and a divide and conquer algorithm is proposed to quickly estimate the intercell movement cost. The workloads of machine are assigned in the formation process. For the bi-directional linear flow layout, a two-phase approach is developed. The jointed problem has been transformed into a multi-terminal network flow model. A cut tree is then constructed and partitioned the machines into a number of cells, and their layout sequences are assigned by comparing the cut capacities. Computational procedures are illustrated with examples and additional experiments are performed with 32 cases, which are adapted from the literature. The numerical study has shown that the approaches are effective and efficient. It also reveals that the cell formation and the material flow feature should be jointly considered when layout or material handling information is available. The two approaches can also be extended to address the cell formation problems when different types of layout or duplicated machines are considered. SHINE-DER LEE 李賢得 2001 學位論文 ; thesis 107 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
博士 === 國立成功大學 === 工業管理學系 === 89 === Abstract
This study is concerned with jointed cell clustering-layout problem in which the cell formation and the intercell layout are determined simultaneously. The machine cells are to be located along two popular material handling facilities, i.e. the unidirectional unicyclic loop network and the linear single-row bi-directional layout. The decision parameters include demand data and routing sequence of parts, processing time, unique and duplicated machine types, and machine capacities or workload. The objective of the joint problem is to minimize the actual intercell flow cost, instead of the typical measure that minimizes the number of intercell movements.
A three-phase heuristic approach is proposed to solve the jointed problem when the unidirectional loop network is considered. In this approach, the intercell flow cost function is reformulated as a weighted criterion and a divide and conquer algorithm is proposed to quickly estimate the intercell movement cost. The workloads of machine are assigned in the formation process. For the bi-directional linear flow layout, a two-phase approach is developed. The jointed problem has been transformed into a multi-terminal network flow model. A cut tree is then constructed and partitioned the machines into a number of cells, and their layout sequences are assigned by comparing the cut capacities.
Computational procedures are illustrated with examples and additional experiments are performed with 32 cases, which are adapted from the literature. The numerical study has shown that the approaches are effective and efficient. It also reveals that the cell formation and the material flow feature should be jointly considered when layout or material handling information is available. The two approaches can also be extended to address the cell formation problems when different types of layout or duplicated machines are considered.
|
author2 |
SHINE-DER LEE |
author_facet |
SHINE-DER LEE CHIH-PING CHIANG 蔣治平 |
author |
CHIH-PING CHIANG 蔣治平 |
spellingShingle |
CHIH-PING CHIANG 蔣治平 Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
author_sort |
CHIH-PING CHIANG |
title |
Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
title_short |
Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
title_full |
Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
title_fullStr |
Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
title_full_unstemmed |
Cell formations in the uni-directional loop and bi-directional linear material flow facilities |
title_sort |
cell formations in the uni-directional loop and bi-directional linear material flow facilities |
publishDate |
2001 |
url |
http://ndltd.ncl.edu.tw/handle/88355205683594239922 |
work_keys_str_mv |
AT chihpingchiang cellformationsintheunidirectionalloopandbidirectionallinearmaterialflowfacilities AT jiǎngzhìpíng cellformationsintheunidirectionalloopandbidirectionallinearmaterialflowfacilities AT chihpingchiang kǎolǜwùliàobānyùntèxìngzhīdānyuánzhìzàoxìtǒngshèjìdānxiàngdānhuíquānyǔshuāngxiàngzhíxiànbùzhì AT jiǎngzhìpíng kǎolǜwùliàobānyùntèxìngzhīdānyuánzhìzàoxìtǒngshèjìdānxiàngdānhuíquānyǔshuāngxiàngzhíxiànbùzhì |
_version_ |
1718169793443397632 |