Loading [MathJax]/extensions/MathMenu.js
A Workstation Solution Based Heuristic Algorithm for Assembly Line Balancing Problem | IEEE Conference Publication | IEEE Xplore

A Workstation Solution Based Heuristic Algorithm for Assembly Line Balancing Problem


Abstract:

In the automotive industry, assembly line balancing work plays an important role in assembly process planning. Assembly line balancing problem is a kind of NP hard proble...Show More

Abstract:

In the automotive industry, assembly line balancing work plays an important role in assembly process planning. Assembly line balancing problem is a kind of NP hard problem, especially for Two-sided assembly line balancing problem. It is too difficult to obtain the optimal result using the commercial solvers directly. This paper presents a heuristic algorithm to deal with the two-sided assembly line balancing problem. Based on the mathematical model of the two-sided assembly line balancing problem, we analyze the characteristics of the problem. A workstation oriented strategy is used to generate assignment for each mated-station. Priority rules are created in the process of solution generation. We implement numerical experiments based on the benchmark data sets. Results verified the effectiveness and efficiencies of the proposed algorithm.
Date of Conference: 22-24 May 2021
Date Added to IEEE Xplore: 30 November 2021
ISBN Information:

ISSN Information:

Conference Location: Kunming, China

Funding Agency:

References is not available for this document.

1 Introduction

The automotive manufacturing contains four main processes: Pressing, Joining, Painting and Assembly. Assembly production is the last stage in which all parts and components are installed on the vehicle body. These works are done on the assembly line that was firstly utilized in auto industry by Henry Ford. After a century, production technologies improve, and the assembly line is widely used in many manufacturing situations. The assembly line in a vehicle factory usually consists of a main assembly line and several pre-assembly lines. There are 1500 to 2000 components that need to be installed in the assembly line for a modern passenger vehicle. Planners in the assembly factory design the sequence of installations before the Start of Production (SOP). The assembly line balancing schedule is planned based on these works. Most line balancing works are done manually according to planners personal experiences in the factory. However, as the models increase it is challenging to finish the line balancing work. The assembly line balancing problem is a demonstrated NP-hard problem. An efficient algorithm for the line balancing problem is necessary to generate a high-quality solution automatically.

Select All
1.
J.R. Jackson, "A Computing Procedure for a Line Balancing Problem", Manage. Sci., vol. 2, no. 3, pp. 261-271, 1956.
2.
L. Schrage and K.R. Baker, "Dynamic programming solution of sequencing problems with precedence constraints", Oper. Res., vol. 26, no. 3, pp. 444-449, 1978.
3.
E. Kao and M Queyranne, "On Dynamic Programming Methods for Assembly Line Balancing", Oper. Res., vol. 30, pp. 375-390, 1982.
4.
P Pinto, D Dannenbring and B Khumawala, "A Branch and Bound Algorithm for Assembly Line Balancing with Paralleling", Int. J. Prod. Res., vol. 13, no. 02, pp. 183-196, 1975.
5.
Roger V. Johnson, "Optimally Balancing Large Assembly Lines with ‘Fable", Manage. Sci., vol. 34, no. 2, pp. 240-253, 1988.
6.
T R Hoffmann, "Eureka: A Hybrid System for Assembly Line Balancing", Manage. Sci., vol. 38, no. 1, pp. 39-47, 1992.
7.
A Scholl and R Klein, "SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing", INFORMS J. Compu., vol. 9, no. 4, pp. 319-334, 1997.
8.
W.B. Helgeson and D.P Birnie, "Assembly Line Balancing Using the Ranked Positional Weighting Technique", Journal of Industrial Engineering, vol. 12, no. 6, pp. 394-398, 1961.
9.
C L Moodie, "A heuristic method of assembly line balancing for assumptions of constant or variable work element times", Purdue University, 1964.
10.
F.B. Talbot and J.H. Patterson, "An integer programming with network cuts for solving line balancing problem", Manage. Sci., vol. 30, no. 1, pp. 85-99, 1984.
11.
Dar-El and M. E, "MALB: A Heuristic Technique for Balancing Large Single-Model Assembly Lines", A I I E Transactions, vol. 5, no. 4, pp. 343-356, 1973.
12.
Y K Kim, Y Kim and Y J Kim, "Two-sided assembly line balancing: A genetic algorithm approach", Production Planning Control, vol. 11, no. 1, pp. 44-53, 2000.
13.
E F Wu, Y Jin, J Bao and X F Hu, "A branch-and-bound algorithm for two-sided assembly line balancing", Int. J. Adv. Manuf. Tech., vol. 39, no. 1, pp. 1009-1015, 2008.
14.
X F Hu, E F Wu and Y Jin, "A station-oriented enumerative algorithm for two-sided assembly line balancing", Eur. J. Oper. Res., vol. 186, no. 1, pp. 435-440, 2008.
15.
A Baykasoglu and T Dereli, "Two-sided assembly line balancing using an ant-colony-based heuristic", Int. J. Adv. Manuf. Tech., vol. 36, pp. 582-588, 2008.
16.
U Ozcan and B Toklu, "A tabu search algorithm for two-sided assembly line balancing", Int. J. Adv. Manuf. Tech., vol. 43, no. 7-8, pp. 822-829, 2009.
17.
Y K Kim, W S Song and J H Kim, "A mathematical model and a genetic algorithm for two-sided assembly line balancing", Comput. Oper. Res., vol. 36, pp. 853-865, 2009.
18.
T O Lee, Y Kim and Y K Kim, "Two-sided assembly line balancing to maximize work relatedness and slackness", Comput. Ind. Eng., vol. 40, no. 3, pp. 273-292, 2001.
19.
JJ Bartholdi, "Balancing Two-sided assembly line: a case study", Int. J. Prod. Res., vol. 31, no. 10, pp. 2447-2461, 1993.

Contact IEEE to Subscribe

References

References is not available for this document.