TY - JOUR

T1 - U-shaped assembly line worker assignment and balancing problem

T2 - A mathematical model and two meta-heuristics

AU - Oksuz, Mehmet Kursat

AU - Buyukozkan, Kadir

AU - Satoglu, Sule Itir

N1 - Publisher Copyright:
© 2017 Elsevier Ltd

PY - 2017/10

Y1 - 2017/10

N2 - As the U-shaped assembly lines are concerned with manual assembly operations, workers’ performance plays a major role. However, the past studies assume that all workers can carry out all tasks with an equal performance level, and actual task times do not depend on the worker who performs it. On the other hand, this is unrealistic. In this study, maximization of the line efficiency for the U-shaped assembly line worker assignment and balancing problem by considering the worker performance is aimed. First, a non-linear model of the problem is formulated, and then it is linearized. Later, an Artificial Bee Colony Algorithm and a Genetic Algorithm are proposed to solve it, in short computational times. A hypothetical data set (Jackson, 1956), a real data set (Cevikcan et al., 2009) and data sets of assembly line worker assignment and balancing problem (Araújo et al., 2015) were solved by using the model and the meta-heuristics. The meta-heuristics were able to reach solutions that have equal line efficiency with the optimum solution found by the proposed mathematical model. The contribution of this study is that the mathematical model for the U-shaped line assembly line worker assignment and balancing type-E problem that considers the workers’ performance is formulated, and an Artificial Bee Colony Algorithm is proposed for the first time for this problem type.

AB - As the U-shaped assembly lines are concerned with manual assembly operations, workers’ performance plays a major role. However, the past studies assume that all workers can carry out all tasks with an equal performance level, and actual task times do not depend on the worker who performs it. On the other hand, this is unrealistic. In this study, maximization of the line efficiency for the U-shaped assembly line worker assignment and balancing problem by considering the worker performance is aimed. First, a non-linear model of the problem is formulated, and then it is linearized. Later, an Artificial Bee Colony Algorithm and a Genetic Algorithm are proposed to solve it, in short computational times. A hypothetical data set (Jackson, 1956), a real data set (Cevikcan et al., 2009) and data sets of assembly line worker assignment and balancing problem (Araújo et al., 2015) were solved by using the model and the meta-heuristics. The meta-heuristics were able to reach solutions that have equal line efficiency with the optimum solution found by the proposed mathematical model. The contribution of this study is that the mathematical model for the U-shaped line assembly line worker assignment and balancing type-E problem that considers the workers’ performance is formulated, and an Artificial Bee Colony Algorithm is proposed for the first time for this problem type.

KW - Artificial Bee Colony Algorithm

KW - Genetic Algorithm

KW - Heterogeneous workers

KW - Integer programming

KW - U-shaped assembly line

KW - Worker assignment

KW - Worker performance

UR - http://www.scopus.com/inward/record.url?scp=85028571206&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2017.08.030

DO - 10.1016/j.cie.2017.08.030

M3 - Article

AN - SCOPUS:85028571206

SN - 0360-8352

VL - 112

SP - 246

EP - 263

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

ER -