In this study, we consider single model deterministic Assembly Line Balancing problem with task paralleling. The objective is to minimize the total cost which is composed of station opening cost and task dependent equipment cost. A branch and bound algorithm that allows two-level task paralleling is proposed. A heuristic algorithm is also developed both for obtaining efficient upper bounds to branch and bound and for achieving good approximate solutions for large sized problems. Computational experiments are conducted to investigate the effects of experimental parameters on the cost-related and algorithm-related performance measures. The exact algorithm results are compared to the proposed heuristic algorithm results, station paralleling results and optimal solutions without paralleling.
Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605392/index.pdf |
Date | 01 September 2003 |
Creators | Kaplan, Ozlem |
Contributors | Ozdemirel, Nur Evin |
Publisher | METU |
Source Sets | Middle East Technical Univ. |
Language | English |
Detected Language | English |
Type | M.S. Thesis |
Format | text/pdf |
Rights | To liberate the content for public access |
Page generated in 0.0011 seconds