Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Flexible assembly line design problem with fixed number of workstations
Download
index.pdf
Date
2009
Author
Barutçuoğlu, Şirin
Metadata
Show full item record
Item Usage Stats
157
views
373
downloads
Cite This
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.
Subject Keywords
Industrial engineering.
,
Flexible manufacturing systems.
URI
http://etd.lib.metu.edu.tr/upload/3/12610697/index.pdf
https://hdl.handle.net/11511/18632
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Flexible assembly line design problem with fixed number of workstations
Barutcuoglu, Sirin; Azizoğlu, Meral (Informa UK Limited, 2011-01-01)
In the paper, we study a flexible assembly line design problem with equipment decisions. 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 equipment to the workstations so as to minimise the total equipment cost. We develop a branch and bound algorithm that uses powerful lower bounds and reduction mechanisms. Our computational ...
Generation of patterned indentations for additive manufacturing technologies
Yaman, Ulaş; Dölen, Melik; Hoffmann, Christoph (Informa UK Limited, 2019-02-01)
This article proposes a novel approach to generate patterned indentations for different additive manufacturing methodologies. Surface textures have many practical applications in various fields, but require special manufacturing considerations. In addition to conventional manufacturing processes, additive processes have also been utilized in the last decade to obtain textured surfaces. The current design and fabrication pipeline of additive manufacturing operations have many disadvantages in that respect. F...
Disassembly line balancing problem with fixed number of workstations and finite supply
Göksoy, Eda; Azizoğlu, Meral; Department of Industrial Engineering (2010)
In this thesis, we consider a Disassembly Line Balancing Problem (DLBP) with fixed number of workstations. We aim to maximize the total value of the recovered parts. We assume that there is a limited supply for the products to be disassembled. Different components can be obtained by disassembling different units of the product. Our aim is to assign the tasks to the workstations of the disassembly line so as to maximize the total value of the recovered parts. We present several upper and one lower bounding p...
Solution approaches for flexible job shop scheduling problems
Balcı, Şerife Aytuğ; Azizoğlu, Meral; Oğuzsoy, Cemal Berk; Department of Industrial Engineering (2013)
In this thesis, we consider a flexible job shop scheduling problem existing in discrete parts manufacturing industries. We are motivated by the production environment of Roketsan Missiles Industries Incorporation, operating at Turkish defense industry. Our objective is to minimize the total weighted completion times of the jobs in the system. We formulate the problem as a mixed integer linear program and find that our model could find optimal solutions only to small sized problem instances. For medium and l...
Off-line nominal path generation of 6-DoF robotic manipulator for edge finishing and inspection processes
Nemer, Mahmoud; Konukseven, Erhan İlhan (Springer Science and Business Media LLC, 2018-10-01)
This paper deals with the development of a Computer-Aided Robotic Machining Process Planning package based on SolidWorks. The main aim of the package is to generate an efficient, collision-free, nominal tool path needed for edge finishing and inspection by utilizing a 6-DoF robotic arm. The overall nominal tool path involves analyzing the geometry of the workpiece, determining and designing an efficient collision-free tool path and finally generating the tool path data for the robot and verifying it. This p...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ş. Barutçuoğlu, “Flexible assembly line design problem with fixed number of workstations,” M.S. - Master of Science, Middle East Technical University, 2009.
