Skip to content
Research Article Peer ReviewedAt least two reviewers Open Access

A Robust Formulation for U-shaped Assembly Line Balancing Problem Under Task Time Uncertainty by Considering Worker Skills

1Karadeniz Technical University
✉ Corresponding author: Ömer Faruk Yılmaz · omerfarukyilmaz@ktu.edu.tr
PDF BibTeX RIS

Abstract

The U-shaped assembly line balancing (UALB) problem has been extensively investigated in the existing academic literature. However, only a limited number of studies consider the uncertainty in the assembly lines. In this research, a robust formulation is developed for the addressed problem under task time uncertainty by focusing on the heterogeneity inherent of workers. The worker resources are not the same in terms of either skills or skill levels. Therefore, it is plausible to investigate the manufacturing system from this perspective to provide managerial insights regarding the performance metrics, such as the total cost, number of stations. Besides, the uncertainty of processes in a manufacturing system must be considered to improve system performance. Since robust optimization is a powerful technique to overcome uncertainty, the robust approach is employed in this study. First, the nominal model for the UALB problem is presented and followed by that the robust counterpart of this model is provided. The optimal results are obtained for different parameter levels after solving the model. The analysis of the results is made through real data provided by a water-meter assembly line. 

Keywords

Cite this article

Yılmaz, Ö. F. (2019). A Robust Formulation for U-shaped Assembly Line Balancing Problem Under Task Time Uncertainty by Considering Worker Skills. In 4th International Symposium on Innovative Approaches in Engineering and Natural Sciences (pp. 28–31). SET Technology. https://doi.org/10.36287/setsci.4.6.015

Article History

Published
22 Dec 2019

License

© 2019 SET Technology. This article is distributed under the terms of the CC BY 4.0.

Research Contributions (2019+)Peer reviewed by at least two reviewers
Open AccessCC BY 4.0
Open Discovery Metadata · DOI · OAI-PMH
Global Reachresearchers worldwide