AN ADAPTIVE SIMULATED ANNEALING METHOD FOR TYPE-ONE SIMPLE ASSEMBLY LINE BALANCING: A REAL LIFE CASE STUDY

Date

2013-12-01

Author

Guden, Huseyin
Meral, Fatma Sedef

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

236
views

0
downloads

In this study, real life assembly line balancing problem of a dishwasher producer is addressed. The line considered is a multi-model assembly line and real life problem instance consists of approximately 300 tasks, 400 precedence relations and 70 stations per product model. The number of stations used to meet a specified production rate is desired to be minimized. To do this, a type-one simple assembly line balancing problem instance is considered for each product model. Due to thelarge size of the problem we could not find the optimal solution of the problem by mathematical programming methods. In order to find good solutions in short times an adaptive simulated annealing algorithm is developed. Performance of the algorithm is tested on several problem instances from the literature and found to be satisfactory. Then it is used to solve the real life problem instanceconsidered and a better solution than the current one is obtained.

Subject Keywords

Assembly line balancing, Adaptive simulated annealing, Type one simple assembly line balancing

URI

https://hdl.handle.net/11511/53215

Journal

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study Guden, H.; Meral, Fatma Sedef (2016-05-01) In this study, we address the deterministic assembly line balancing problem (ALBP) in a multiple product-models environment with multiple objectives. We have been motivated by the assembly line balancing problem of a white goods product production line that is a multi-model type line with 68 stations through which four product-models are assembled, each with approximately 400 precedence relations and 300 tasks. In the plant, to cope with the increasing demand in the medium term, the efficiency of the line i...
An adaptive simulated annealing method for assembly line balancing and a case study Güden, Hüseyin; Meral, Fatma Sedef; Department of Industrial Engineering (2006) Assembly line balancing problem is one of the most studied NP-Hard problems. NP-Hardness leads us to search for a good solution instead of the optimal solution especially for the big-size problems. Meta-heuristic algorithms are the search methods which are developed to find good solutions to the big-size and combinatorial problems. In this study, it is aimed at solving the multi-objective multi-model assembly line balancing problem of a company. A meta-heuristic algorithm is developed to solve the determini...
Rebalancing in assembly lines Girit, Utku; Azizoğlu, Meral; Department of Industrial Engineering (2019) Assembly line balancing is an important and well recognized operations research problem. The current balancing might not stay optimal for a long time due to the changing conditions. The changing conditions, like disruptions in one or more workstations, may cause some inefficiencies, even infeasibilities, for the current balance. In this study, after the disruption, we aim to rebalance the assembly line by considering the trade-off between workload balancing (efficiency measure) and total displacement amount...
Rebalancing of assembly lines Sancı, Ece; Azizoğlu, Meral; Department of Industrial Engineering (2015) In this study, we consider an assembly line rebalancing problem. We assume that there is a disruption on one or more workstations that makes the current solution infeasible. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and the stability measure of number of tasks assigned to different workstations in the original and new solutions. We generate all nondominated objective vectors with respect to our efficiency and stability measures...
A stochastic disassembly line balancing problem with hazardous tasks Göksoy Kalaycılar, Eda; Batun, Sakine; Department of Industrial Engineering (2020-11) In this thesis, we study a Stochastic Disassembly Line Balancing Problem (SDLBP) with hazardous tasks. We define success and failure events for each hazardous task and describe several scenarios over all hazardous tasks. Our aim is to maximize expected profit over all scenarios. We construct mathematical model with one, two and three hazardous tasks. Then, general formulation both in nonlinear and linear form is studied. We test the performance of the model on randomly generated data using the networks take...

Citation Formats

H. Guden and F. S. Meral, “AN ADAPTIVE SIMULATED ANNEALING METHOD FOR TYPE-ONE SIMPLE ASSEMBLY LINE BALANCING: A REAL LIFE CASE STUDY,” JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, pp. 897–908, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53215.