Article ID: | iaor20131351 |
Volume: | 64 |
Issue: | 2 |
Start Page Number: | 602 |
End Page Number: | 609 |
Publication Date: | Feb 2013 |
Journal: | Computers & Industrial Engineering |
Authors: | Topaloglu Seyda, Tuncel Gonca |
Keywords: | assembly line balancing, programming (binary) |
In this paper, we present a real‐life Assembly Line Balancing Problem for an electronics manufacturing company. The main characteristics of the problem are as follows: (i) a set of operations are related to the front part of the workpiece and others are related to the back part of the workpiece, which in turn makes all tasks dependent on the position of the workpiece, (ii) some of the tasks must be executed on the same station and no other tasks should be assigned to this station due to technological restrictions, (iii) parallel stations are allowed to increase the line efficiency at the required production rate and to overcome the problem of assigning tasks with operation times that exceed the cycle time. Initially, the problem is formulated as a 0–1 integer programming model and solved using CPLEX solver. Then, the effect of alternative work schedules such as multiple shifts and overtime on the expected labor cost of the line is analyzed. Considering alternative work schedules while balancing the line for corresponding cycle times allows us to select an efficient assembly line for the company, resulting in a lower labor cost and a more balanced line with respect to the operation times and the activity of the workers at each station. Lastly, a computational study is conducted to evaluate the performance of the proposed model. It is found that the model is capable of producing high quality solutions in reasonable solution times.