Assembly line balancing with multi-manned tasks

Download

index.pdf

Date

2007

Author

Esin, Ceyhan Erdem

Metadata

Show full item record

Item Usage Stats

229
views

94
downloads

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.

Subject Keywords

Industrial Engineering

URI

http://etd.lib.metu.edu.tr/upload/12608939/index.pdf
https://hdl.handle.net/11511/17046

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

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...
Demand driven disassembly planning Ertem, Tulû; Bayındır, Zeynep Pelin; Department of Industrial Engineering (2007) In this thesis, we deal with the demand driven disassembly planning. The main aim of the study is to construct heuristic approaches according to the suggested improvements in the literature. These heuristic approaches are further improved by recognizing the key points of the disassembly planning problem. All of the solution approaches aim minimizing total cost related to relevant costs of disassembly operations. Another subject given attention in this thesis is the importance of the setup cost on the disass...
A heuristic approach for profit oriented disassembly lot-sizing problem Kaya, Melike; Bayındır, Zeynep Pelin; Çetinkaya, Ferda Can; Department of Industrial Engineering (2011) In this thesis, we work on adisassembly lot-sizing problem for multiple products with parts commonality,i.e., general product structure. We assume that supply of discarded products is infinite. When a product (or a subassembly) is disassembled, all its immediate child items are obtained,i.e., complete disassembly case.Intermediate and leaf items obtained are demandedbyexternal suppliers or remanufacturers. The maximum possible salesfor each intermediate and leaf item are known.Sales of the intermediate and ...
Multiobjective hub location problem Barutçuoğlu, Aras; Köksalan, Murat; Department of Industrial Engineering (2009) In this study, we propose a two-phase solution approach for approximating the efficient frontier of a bicriteria hub location problem. We develop an evolutionary algorithm to locate the hubs on the network as the first phase. In the second phase, we develop a bounding procedure based on dominance relations and using the determined bounds, we solve the allocation subproblem for each located hub set. The two-phase approach is tested on the Australian Post data set and it is observed that our approach approxim...
Flexible assembly line design problem with fixed number of workstations Barutçuoğlu, Şirin; Azizoğlu, Meral; Department of Industrial Engineering (2009) 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 pow...

Citation Formats

C. E. Esin, “Assembly line balancing with multi-manned tasks,” M.S. - Master of Science, Middle East Technical University, 2007.