In this thesis, we define a new problem area for assembly lines. In the literature, there are various studies on assembly line balancing, but none of them consider multi-manned tasks, task to which at least two operators have to be assigned. Two mathematical models and one constraint programming model are developed for both Type-I and Type-II ALB problems. The objective of Type-I problem is to minimize
the number of stations whereas the objective of Type-II problem is to minimize the cycle time. In addition to this, valid inequalities are introduced to make models more efficient. Moreover, heuristic algorithms for both types are developed for large-sized problems. All formulations are applied to a real case study and then experimental analysis are conducted for all formulations to see the effects of problem parameters
on performance measures. Exact models are compared each other and performance of heuristic algorithms are compared against the lower bounds.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12608939/index.pdf |
| Date | 01 September 2007 |
| Creators | Esin, Ceyhan Erdem |
| Contributors | Kirca, Omer |
| 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.0019 seconds