ABSTRACT
FLEXIBLE ASSEMBLY LINE DESIGN PROBLEM WITH FIXED NUMBER OF WORKSTATIONS
Barutç / uoglu, Sirin
M.S. Department of Industrial Engineering
Supervisor: Prof. Dr. Meral Azizoglu
July 2009, 70 pages
In this thesis, we study a Flexible Assembly Line Design problem. We assume the task times and equipment costs are correlated in the sense that for all tasks the cheaper equipment gives no smaller task time. Given the cycle time and number of workstations we aim to find the assignment of tasks and equipments to the workstations that minimizes the total equipment cost. We study a special case of the problem with identical task times. For the general case, we develop a branch and bound algorithm that uses powerful lower bounds and reduction mechanisms. We test the performance of our branch and bound algorithm on randomly generated test problems. The results of our experiments have revealed that we are able to solve large-sized problem instances in reasonable times.
Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/3/12610697/index.pdf |
Date | 01 July 2009 |
Creators | Barutcuoglu, Sirin |
Contributors | Azizoglu, Meral |
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.0016 seconds