Mixed-model two-sided assembly line balancing

Download

index.pdf

Date

2010

Author

Uçar, Emre

Metadata

Show full item record

Item Usage Stats

182
views

235
downloads

In this study we focus on two-sided mixed-model assembly line balancing type-I problem. There is a production target for a fixed time horizon and the objective is to produce this amount with the minimum level of workforce. A mathematical model is developed to solve this problem in an optimal manner. For large scale problems, the mathematical model fails to give the optimal solution within reasonable computational times. Thus, a heuristic approach based on threshold accepting algorithm is presented. Both the mathematical model and the heuristic approach are executed to solve several example problems from the literature and a case study problem which is derived from the refrigerator production. Computational experiments are carried out using both approaches. It is observed that the heuristic procedure finds good solutions within very reasonable computational times.

Subject Keywords

Industrial Engineering., Management Engineering.

URI

http://etd.lib.metu.edu.tr/upload/3/12611688/index.pdf
https://hdl.handle.net/11511/19424

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Two-sided assembly line balancing models and heuristics Arıkan, Uğur; Kırca, Ömer; Department of Industrial Engineering (2009) This study is focused on two-sided assembly line balancing problems of type-I and type-II. This problem is encountered in production environments where a two-sided assembly line is used to produce physically large products. For type-I problems, there is a specified production target for a fixed time interval and the objective is to reach this production capacity with the minimum assembly line length used. On the other hand, type-II problem focuses on reaching the maximum production level using a fixed assem...
Comparison of the resource allocation cababilities of project management software packages in resource constrained project scheduling problems Hekimoğlu, Özge; Serpil, Canan; Department of Industrial Engineering (2007) In this study, results of a comparison on benchmark test problems are presented to investigate the performance of Primavera V.4.1 with its two resource allocation priority rules and MS Project 2003. Resource allocation capabilities of the packages are measured in terms of deviation from the upper bound of the minimum makespan. Resource constrained project scheduling problem instances are taken from PSPLIB which are generated under a factorial design from ProGen. Statistical tests are applied to the results ...
Rebalancing the assembly lines with total squared workload and total replacement distance objectives Girit, Utku; Azizoğlu, Meral (Informa UK Limited, 2020-01-01) Assembly line balancing is an important and well recognised operations research problem. The current line balance may not stay optimal, even feasible, due to the disruptions in one or more workstations. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (fairness measure) and total replacement distance for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective functio...
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...
Assembly line balancing with multi-manned tasks Esin, Ceyhan Erdem; Kırca, Ömer; Department of Industrial Engineering (2007) 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...

Citation Formats

E. Uçar, “Mixed-model two-sided assembly line balancing,” M.S. - Master of Science, Middle East Technical University, 2010.