Rebalancing of assembly lines

Download

index.pdf

Date

2015

Author

Sancı, Ece

Metadata

Show full item record

Item Usage Stats

45
views

22
downloads

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. We develop two optimization algorithms: classical approach and branch and bound algorithm. The results of our experiments show the favorable behaviors of both algorithms and superiority of branch and bound algorithm.

Subject Keywords

Assembly-line methods., Production engineering., Manufacturing processes.

URI

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

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

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 the assembly lines: exact solution approaches Sanci, Ece; Azizoğlu, Meral (2017-01-01) In this study, we consider an assembly line rebalancing problem with disruptions caused by workstation breakdowns or shutdowns. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and stability measure of number of tasks assigned to different workstations in the original and new balances. Our aim is to generate all nondominated objective vectors with respect to the efficiency and stability measures. We develop two optimisation algorithms...
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...
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...
Workload smoothing in assembly lines İmat, Sadullah; Azizoğlu, Meral; Department of Industrial Engineering (2014) In this thesis, we consider a simple assembly line balancing problem with fixed number of workstations and predefined cycle time. Our objective is to minimize the sum of the squared deviations of the workstation loads from the cycle time. We first present pure integer nonlinear programming model and then convert the model into mixed integer linear program. We develop several optimality properties and bounding mechanisms, and use them in our branch and bound algorithm. The results of our computational study ...

Citation Formats

E. Sancı, “Rebalancing of assembly lines,” M.S. - Master of Science, Middle East Technical University, 2015.