A Study on the Solution Approach for the Manufacturing Cell Formation Problem
碩士 === 大葉大學 === 工業工程研究所 === 88 === Cell formation problem is one of the most important problems during the manufacturing process. Due to its NP-Complete characteristics, it is difficult to obtain optimal cell formation in an acceptable amount of time. In this study, a tabu-based heuristic algorith...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78734742149406477787 |
| Summary: | 碩士 === 大葉大學 === 工業工程研究所 === 88 === Cell formation problem is one of the most important problems during the manufacturing process. Due to its NP-Complete characteristics, it is difficult to obtain optimal cell formation in an acceptable amount of time. In this study, a tabu-based heuristic algorithm is presented to solve the problem.
Since the structure of generalized assignment problems (GAP) is embedded in the cell formation, a good solution to the GAP is beneficial in obtaining solutions of cell formation problems. A tabu search heuristic algorithm employing both long-term memory and dynamic tabu list size is designed to solve the GAP first. This algorithm is then applied to solving the cell formation problems.
Apart from tabu search, a Lagragian Relaxation approach is also presented to compare the performance of each method with those published in the literature. The results indicate that both proposed methods are capable of obtaining good solutions in a reasonable amount of time.
|
|---|