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
Rebalancing in assembly lines
Download
index.pdf
Date
2019
Author
Girit, Utku
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
232
views
84
downloads
Cite This
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 for the tasks assigned to the different workstations (stability measure). We try to generate all non-dominated objective function vectors for the defined efficiency and stability measures. Two algorithms are developed: classical approach and tabu search algorithm. Our experiments have shown that the classical approach returns exact non dominated objective vectors with up to 40 tasks and 7 workstations in one hour and the tabu search algorithm returns approximate non dominated objective vectors that are very close to their exact counterparts and can solve large sized instances, very quickly.
Subject Keywords
Assembly-line methods.
,
Keywords: Assembly Lines
,
Rebalancing
,
Workload Balancing
,
Classical Approach
,
Tabu Search.
URI
http://etd.lib.metu.edu.tr/upload/12624471/index.pdf
https://hdl.handle.net/11511/44323
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
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...
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...
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...
Assembly line balancing with station paralleling
Ege, Yunus; Azizoğlu, Meral; Özdemirel, Nur Evin (2009-11-01)
We consider the NP-hard problem of assembly line balancing with station paralleling. We assume an arbitrary number of parallel workstations can be assigned to each stage. Every task requires a specified tooling/equipment, and this tooling/equipment should be available in all parallel workstations of the stage to which the task is assigned. Our objective is to find an assignment of tasks to stages so as to minimize sum of station opening and tooling/equipment costs. We propose two branch and bound algorithms...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
U. Girit, “Rebalancing in assembly lines,” Thesis (M.S.) -- Graduate School of Natural and Applied Sciences. Industrial Engineering., Middle East Technical University, 2019.
