Open access peer-reviewed chapter

Final Results of Assembly Line Balancing Problem

By Waldemar Grzechca

Reviewed: July 13th 2011Published: August 17th 2011

DOI: 10.5772/38865

Downloaded: 6073

1. Introduction

The manufacturing assembly line was first introduced by Henry Ford in the early 1900’s. It was designed to be an efficient, highly productive way of manufacturing a particular product. The basic assembly line consists of a set of workstations arranged in a linear fashion, with each station connected by a material handling device. The basic movement of material through an assembly line begins with a part being fed into the first station at a predetermined feed rate. A station is considered any point on the assembly line in which a task is performed on the part. These tasks can be performed by machinery, robots, and/or human operators. Once the part enters a station, a task is then performed on the part, and the part is fed to the next operation. The time it takes to complete a task at each operation is known as the process time (Sury, 1971). The cycle time of an assembly line is predetermined by a desired production rate. This production rate is set so that the desired amount of end product is produced within a certain time period (Baybars, 1986). In order for the assembly line to maintain a certain production rate, the sum of the processing times at each station must not exceed the stations’ cycle time (Fonseca et al, 2005). If the sum of the processing times within a station is less than the cycle time, idle time is said to be present at that station (Erel et al,1998). One of the main issues concerning the development of an assembly line is how to arrange the tasks to be performed. This arrangement may be somewhat subjective, but has to be dictated by implied rules set forth by the production sequence (Kao, 1976). For the manufacturing of any item, there are some sequences of tasks that must be followed. The assembly line balancing problem (ALBP) originated with the invention of the assembly line. Helgeson et al (Helgeson et al, 1961) were the first to propose the ALBP, and Salveson (Salveson, 1955) was the first to publish the problem in its mathematical form. However, during the first forty years of the assembly line’s existence, only trial-and-error methods were used to balance the lines (Erel et al,, 1998). Since then, there have been numerous methods developed to solve the different forms of the ALBP. Salveson (Salveson, 1955) provided the first mathematical attempt by solving the problem as a linear program. Gutjahr and Nemhauser (Gutjahr & Nemhauser, 1964) showed that the ALBP problem falls into the class of NP-hard combinatorial optimization problems. This means that an optimal solution is not guaranteed for problems of significant size. Therefore, heuristic methods have become the most popular techniques for solving the problem.

2. Heuristic methods in assembly line balancing problem

The heuristic approach bases on logic and common sense rather than on mathematical proof. Heuristics do not guarantee an optimal solution, but results in good feasible solutions which approach the true optimum. Most of the described heuristic solutions in literature are the ones designed for solving Single Assembly Line Balancing Problem. Moreover, most of them are based on simple priority rules (constructive methods) and generate one or a few feasible solutions. Task-oriented procedures choose the highest priority task from the list of available tasks and assign it to the earliest station which is assignable. Among task-oriented procedures we can distinguish immediate-update-first-fit (IUFF) and general-first-fit methods depending on whether the set of available tasks is updated immediately after assigning a task or after the assigning of all currently available tasks. Due to its greater flexibility immediate-update-first-fit method is used more frequently. The main idea behind this heuristic is assigning tasks to stations basing on the numerical score. There are several ways to determine (calculate) the score for each tasks. One could easily create his own way of determining the score, but it is not obvious if it yields good result. In the following section five different methods found in the literature are presented along with the solution they give for our simple example. The methods are implemented in the Line Balancing program as well. From the moment the appropriate score for each task is determined there is no difference in execution of methods and the required steps to obtain the solution are as follows:

  1. Assign a numerical score n(x) to each task x.

  2. Update the set of available tasks (those whose immediate predecessors have been already assigned).

  3. Among the available tasks, assign the task with the highest numerical score to the first station in which the capacity and precedence constraints will not be violated. Go to STEP 2.

The most popular heuristics which belongs to IUFF group are:

IUFF-RPW Immediate Update First Fit – Ranked Positional Weight,

IUFF-NOF Immediate Update First Fit – Number of Followers,

IUFF-NOIF Immediate Update First Fit – Number of Immediate Followers,

IUFF-NOP Immediate Update First Fit – Number of Predecessors,

IUFF-WET Immediate Update First Fit – Work Element Time.

In the literature we can often find the implementation of Kilbridge & Wester or Moodie & Young methods, too. Both of them base on precedence graph or precedence matrix of produced items.

3. Measures of final results of assembly line balancing problem

Some measures of solution quality have appeared in line balancing problem. Below are presented three of them (Scholl, 1999).

Line efficiency (LE) shows the percentage utilization of the line. It is expressed as ratio of total station time to the cycle time multiplied by the number of workstations:

LE=i=1KSTicK100%E1

where: K - total number of workstations,

c - cycle time.

Smoothness index (SI) describes relative smoothness for a given assembly line balance. Perfect balance is indicated by smoothness index 0. This index is calculated in the following manner:

SI=i=1K(STmaxSTi)2E2

where:

STmax - maximum station time (in most cases cycle time),

STi - station time of station i.

Time of the line (LT) describes the period of time which is need for the product to be completed on an assembly line:

LT=c(K1)+TKE3

where:

c - cycle time,

K -total number of workstations,

TK – processing time of last station.

Two-sided assembly lines (Fig. 1.) are typically found in producing large-sized products, such as trucks and buses. Assembling these products is in some respects different from assembling small products. Some assembly operations prefer to be performed at one of the two sides (Bartholdi, 1993).

Figure 1.

Two-sided assembly line structure

The final result estimation of two-sided assembly line balance needs some modification of existing measures (Grzechca, 2008).

Time of line for TALBP

LT=c(Km1)+Max{t(SK),t(SK1)}E4

where:

Km – number of mated-stations

K – number of assigned single stations

t(SK) – processing time of the last single station

As far as smoothness index and line efficiency are concerned, its estimation, on contrary to LT, is performed without any change to original version. These criterions simply refer to each individual station, despite of parallel character of the method.

But for more detailed information about the balance of right or left side of the assembly line additional measures will be proposed:

Smoothness index of the left side

SIL=i=1K(STmaxLSTiL)2E5

where:

SIL- smoothness index of the left side of two-sided line

STmaxL- maximum of duration time of left allocated stations

STiL- duration time of i-th left allocated station

Smoothness index of the right side

SIR=i=1K(STmaxRSTiR)2E6

where:

SIR- smoothness index of the right side of two-sided line,

STmaxR- maximum of duration time of right allocated stations,

STiR- duration time of i-th right allocated station.

4. Line and station efficiency

Efficiency line was introduced to the assembly line balancing problem by Salveson. It was the optimization goal of ALBP and the best solution was when it achieved 100%. Unfortunately this measure is only useful when number of stations or cycle time are changed. If for many final results we obtain the same number of stations and cycle time the line efficiency does not deliver us the detailed knowledge about quality of the line balance. Example of 12 tasks will be discussed. In Table 1 processing task times are presented. Figure 2 shows the relations between tasks (technology of assembly).

Figure 2.

Precedence graph of 12 tasks numerical example

task123456789101112
time204070103011326027385012

Table 1.

Operation times for numerical example

Ranked Positional Weight (Helgeson et al, 1961) and Immediate Update First Fit – Working Element Time heuristics for obtaining the balance of assembly line were chosen. As we can see ( Fig. 3 ÷ 5) final results are different. For time-oriented balance we got 5 stations and LE for different heuristics is the same. Author proposes an additional station efficiency measurement which allows to find “bottleneck” in the production system and helps to estimate a good feasible line balance. The new measure describes more detailed the efficiency of each workstation and helps to find the worst point in whole assembly structure.

Station efficiency (LESTi) shows the percentage utilization of each workstation. It is expressed as ratio of station time to the cycle time:

LESTi=STic100%E7
MeasuresRPW heuristicIUFF–WET heuristicMeasuresRPW heuristicIUFF–WET heuristic
SI40,4259,08LEST190 %81 %
LT462462LEST192 %98 %
LE80%80%LEST165 %59 %
LEST190 %100 %LEST162 %62 %

Table 2.

Detailed measures of final results of RPW and IUFF-WET heuristics

Figure 3.

Final balance of 12 tasks example using RPW heuristic

Figure 4.

Final balance of 12 tasks example using IUFF-WET heuristic

Figure 5.

Station efficiency of 12 tasks example using RPW and IUFF – WET heuristics

5. Last station problem

Below are presented two heuristic solution. We consider the case of single assembly line (Fig. 6.) where all tasks can be assigned to any position (E). The cycle time is 16.

Fig. 7. presents solution where three stations have efficiency 100 % or very close to the value. Last station has an idle time which is a consequence of completed number of tasks. Fig. 8. shows solution where the last station is utilized in 100 %. The contribution of tasks causes idle times of second and third station. As we can observe both solutions are feasible but with different assignment of tasks and different station efficiency. RPW solution is near optimal but the last station idle time is the biggest of all stations. WET solution is feasible and not so close to optimal but smoothness index of this final result is smaller (balancing or equalizing problem).

Figure 6.

Numerical example of 12 tasks – time duration and positional constrains are given in brakes (L – left, R – right, E – any position)

Figure 7.

Final solution of assembly line balancing problem – RPW heuristic

Figure 8.

Final solution of assembly line balancing problem – IUFF - WET heuristic

6. Assembly line structure problem

We consider numerical example from Fig. 8. The positional constrains are respected. As we can observe not only assigning of task becomes a problem (Fig. 9. ÷ Fig. 14.). The structure of assembly line can changed for different cycle times (Grzechca, 2010).

Figure 9.

Assembly line balance (c=16)

Figure 10.

Assembly line structure (c=16)

Figure 11.

Assembly line balance (c=15)

Figure 12.

Assembly line structure (c=15)

Figure 13.

Assembly line balance (c=12)

Figure 14.

Assembly line structure (c=12)

In two-sided assembly line balancing problem it is very difficult to obtain a complete station structure. This type of line very hard depends on precedence and position constraints.

7. Conclusions

Assembly lines are a popular manufacturing structure. Assembly line balancing problem is known more than 50 years. There are hundreds exact and heuristic methods. It is very important to obtain the feasible and acceptable results. It is very important to analyze and estimate the final results and to implement the best one. Author of the chapter hopes that the presented knowledge helps to understand the problem.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Waldemar Grzechca (August 17th 2011). Final Results of Assembly Line Balancing Problem, Assembly Line, Waldemar Grzechca, IntechOpen, DOI: 10.5772/38865. Available from:

Embed this chapter on your site Copy to clipboard

<iframe src="http://www.intechopen.com/embed/assembly-line-theory-and-practice/final-results-of-assembly-line-balancing-problem" />

Embed this code snippet in the HTML of your website to show this chapter

chapter statistics

6073total chapter downloads

2Crossref citations

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Assembly Line Balancing and Sequencing

By Mohammad Kamal Uddin and Jose Luis Martinez Lastra

Related Book

First chapter

Multi-Agent Based Distributed Manufacturing

By J. Li, J.Y. H. Fuh, Y.F. Zhang and A.Y.C. Nee

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More about us