Mixed Assembly Line Balancing

Assembly lines

An AL consists of a production arrangement formed by workstations typically distributed over a movement system. The product is sequentially released from station to station, suffering changes until it reaches the final assembly station.

The assembly lines that produce identical products are call single-model line, or one-model line. When there are differences in the products, two classifications arise. The first is the multi-model line or multi-line model, which shows significant differences in production processes, and different products are manufactured in larger batches than a unit to minimize the setup impacts. The second classification is known as mixed-model line or mixed line, which is apply when there is similarity of productive process and there is no setup for process adjustment. This makes it possible to launch the products in the line in units randomly. For each model, different processing times are required, so the amount of work at the same operator in the same workstation is uneven. Cases which operator ends the job before the next cycle or not ends the job within the cycle time make AL unbalanced and efficiency is reduced. Even so, for Askin & Standridge apud Souza et al., this production system tends to be one of the most efficient, but requires reliable process and it with low variability in processing time of the workstations (in the practical application context of the methodology proposed, low variability refers to a difference less than 30% of the time variation between models). Figure 1 illustrates the above definitions, where the geometry of the figures refers to different products.

Figure 1 Assembly line types. Source: Adapted from Becker & Scholl.

In the AL design, the main issues to deal are: (i) define the cycle time; (ii) determine the number of workstations; (iii) balance the AL; and (iv) determine the models production order. Another concern of AL design is to minimize the lead time, which means reducing the gap of time between the initiation and completion of the product AL. As shorter is the lead time, greater the potential sale of products. Another premise for the proper functioning of ALs is time the station (S) does not exceed the cycle time, according to Equation 1.

 $\max t_{k} \leq \max S_{j} \leq T_{c} \leq \frac{1}{D}$

where $S_j$ is the total time of station $j (j=1,...,W)$, representing the sum of performing times tasks allocated to each station in time units; $t_k$ is the processing time of the $k^{th}$ task on time unit; k identifies the task such that $k=1,..., N; T_c$ is the time cycle and D is the product demand rate.

The cycle time ($T_c$) is the time when a product is released from station to station, defined by the Equation 2.

$T_{c}=\frac{\text { available time in period p }}{\text { demand in period p }}$

The number of workstations needed to meet demand varies with the AL settings and restrictions. According Peinado and Graeml, the minimum number of workstations for ALs counting with only one operator can be estimated by Equation 3.

$\text { Number of work stations }=\frac{\sum \text { individual tasks times }}{T_{c}}$

To balance the tasks, it is essential to know precedence diagram (Figure 2). This diagram shows the order of tasks execution, respecting technological requirements or item production characteristics.

Figure 2 Exemple of precedence diagram. Source: Adapted from Becker & Scholl.

In precedence diagram, the numbers within the circles represent tasks, while the arrows joining the circles show the precedence relation. The sum of the tasks times assigned to a station is known as station time.

Each task time can be achieved by chrono-analyse among other methods. The chrono-analyse is a way of measuring the work by means of statistical methods, allowing calculating the standard time. The standard time includes a series of factors, such as operator speed, personal needs and relieving fatigue, among others; such factors can be found in specialized literature in the area. The standard time of performing tasks can also be determined by predetermined times.

The task processing times are also used to determine the production capability of a AL. Capacity is the maximum amount of items produced in the AL in a given time interval; to determine the production capacity, it is necessary to identify the bottlenecks in the AL. Therefore, the production capacity is calculated on the basis of working time available and the time of the bottleneck station, as in Equation 4.

$\text { Production capacity }=\frac{\text { Available time in period p }}{\text { Time of the bottlneck station }}$

Assembly line balancing

The Assembly Line Balance (ALB) is known as the classic problem of AL balancing, consisting in the allocation of tasks on a workstation in a way that downtime is minimized and the precedence constraints are met. The ALB allows achieve the best use of available resources so that satisfactory production rates are reached at a minimum cost. The balancing is necessary when there are process changes, such as adding or deleting tasks, change of components, changes in processing time and also in the implementation of new processes.

According to Becker & Scholl, 2006, the assembly line balancing problem can be classified into four categories, as shown in Figure 3. This classification is detailed as follows:

Figure 3 AL balancing problem classification. Source: Adapted from Ghosh & Gagnon.

i.i 

Another important classification split the line balancing problems into two categories: (i) simple assembly line balancing problems, indicating that no restrictions are relaxed; and (ii) generic balancing problems, which fit the line balancing problems that aim to solve problems with additional features.

According Van Zante-de Forkket & De Kok apud Gerhardt, the fundamental difference between a single model line balancing problem for a multi-model is the precedence diagram. Such, many authors, to develop methods to solve multi-model line balancing problems, transform the problem into single model. Two methods can be used: (i) equivalent precedence diagram, and (ii) adjusting the processing taks time.

i. i

Figure 4  Precedence diagram to the model A (a) and model B (b). Source: Adapted from Gerhardt.

Figure 5 Precedence diagram equivalent models A and B. Source: Adapted from Gerhardt.

According to van Zante-de Fokkert & de Kok, the balance of AL multi-model based on equivalent precedence diagramming method can be compared to balancing single AL model. However, the allocation of tasks to workstations is performed based on the total shift time duration and not in cycle time, which is used as the basis to balancing AL single model.

 i. ii

 
In turn, Becker & Scholl emphasizes that both methods (i) and (ii) exhibit inefficiencies resulting from variations in stations processing times, which depend on the production model. Such inconsistencies may generate work overload or idle for operators.

Traditionally, two indicators are used to evaluate balancing quality AL: Balance Delay, which represents a percentage of time that the AL remains idle; and Smoothness Index (softness Index), which measures the difference between the maximum total working time between the stations and the total times of the other work stations.

Driscoll & Thilakawardana introduce alternative ways to evaluate the balance of the AL. The Line efficiency (LE) quantifies the use of AL and has aspects of economic evaluation; Balancing efficiency (BE) quantifies the tasks allocation quality for the workstations, which may consequently cause an increase in the production rate. Both indicators are dimensionless and represented using a scale from 0 to 100%, where 100% represents the best result. They are calculated according to Equations 6 and 7 respectively.

$L E=\frac{\sum_{k+1}^{N} t_{k}}{W \times T_{e}} \times 100$

$B E=\left[1-\frac{\sum_{j=1}^{W}\left|S_{j}-S_{\mathrm{av}}\right|}{W \times S_{\mathrm{aw}}}\right] \times 100$

where $s_{av}$ is the average time of workstations and W the number of workstations.

Soluctions for ALB

Considering that the ALB problem may be shown on NP-hard combinatorial optimization category, several researches have developed computational or heuristic approaches. Ghosh & Gagnon classify methods for balancing ALB as follows:

(i) Rank and Assign Methods: In these methods, tasks are sorted based on criteria or rules of priority and assigned to stations relying on an order that does not violate the relationship of precedence constraints and cycle time;

(ii) Tree Search Methods: These methods are essentially integer programming relying on the Branch & Bound method. Approaches in this category can also be termed as enumerative methods;

(iii) Random Sampling Methods: These methods randomly assign tasks to workstations in view of the precedence constraint and cycle time; and

(iv) Other methods: aggregation methods (task elements are grouped into composite tasks), Successive Approximation (a great algorithm is applied successively as a heuristic in a simpler version of the problem), and Learning Methods (based on the premise that the experience acquired minor problem solving is used to solve larger problems).

Cristo, Ponnambalam et al. and Chow highlight the following heuristics to ALB troubleshooting: Rank positional weight, Kilbridge and Wester's method, Largest set ruler. The foundations of heuristics above are now displayed.

• RPW-Rank Positional Weight: this method was introduced by Hegelson and Birnie in the 60s, having generated satisfactory and fast solutions according Boctor apud Praça. Its operation consists in calculating the positional weight of each task according to the precedence diagram. The weight is the sum of the task time with the time tasks that predate it. In sequence, the positional weights should be arranged in descending order, and the tasks assigned to the workstations according to the order of the positional weight, respecting the precedence constraints. Further details on the method can be found in Chow.
  
  
• Kilbridge e Wester Method (KWM): This method selection work elements to describe the station according to the column Precedence Diagramming position as shown in Figure 6. In sequence, tasks are arranged in descending order of processing time. Finally, tasks are allocated to workstations in accordance with such order, thus ensuring that the largest elements are allocated first and increasing the chance of each station time get closer to the cycle time.
  

Figure 6 Precedence diagram divided in column by Kilbridge and Wester method. Source: Adapted from Gerhardt & Fogliatto.

• Largest Candidate Rule (LCR): This heuristic allows obtaining results in less time than the positional weights method. Initially, one should list tasks in descending order of processing time; then the task should be assigned to the workstations according to the order of the list without violating any precedence constraint or exceed the cycle time.

This section proposes a new balancing heuristics for mixed AL titled target mobile RPW (RPW-MVM), which relies on heuristics of RPW positional weights originally proposed by Helgeson & Birnie. Such proposition focuses on a production environment amenable to changes in product mix, which cause imbalances on the workstations and generate productive capacity constraints in AL, making it unable to meet the required production demand.

The heuristic allows the AL meets the production demands characterized by several product mix composition, without the need for interventions to balancing adjustment or sequencing of actions to launch the products. This requires that the time of each model on all workstations is less than the AL cycle time. In addition, the proposed heuristic innovates in the tasks distribution format to workstations, proposing a target mobile which aims to improve the tasks distribution between the stations compared to the original RPW. The proposed heuristic is now detailed.

RPW-MVM

The original RPW is fundamentally guided by a pre-established time cycle; therefore, it can be assumed that the amount limiting target of the allocable task to a given workstation is the cycle time, which is fixed. Thus, the tasks allocation to workstations may have an accumulated imbalance in the first workstation, which typically results in significant losses to the AL. It is proposed then a change in this target, which becomes mobile (and called Moving Target - MVM).

The MVM is calculated for each workstation and depends on the number of workstations to be balanced. It serves to improve the tasks distribution between the workstations not balanced according to the time of the not yet allocated tasks. Every changing of the station, the target is recalculated for each model (hence mobile), and then identified the condition that allows allocation of the remaining tasks of the product with longer not yet allocated operations. In other words, MVM allows for each workstation to exchange the entire contents of the working model under review to be distributed evenly among the remaining stations.

Figures 7 and 8 illustrate the RPW without target mobile and with moving target (MVM), respectively. The MVM yields better smoothness index for AL and, therefore, benefit and ergonomic productive character.

Figure 7 Balancing with RPW and without MVM heuristics. Source: The authors.

Figure 8 Balancing with RPW and MVM heuristics. Source: The authors.

Following are presented the steps to perform the RPW-MVM.

Step 1: Set the diagram/equivalent precedence matrix of all models;

Step 2: Unlike the RPW in AL single model, the RPW-MVM is a balancing in a AL with more than one product model, where each model has its own tasks processing time. So for the average processing time for common tasks to the different models, is needed to define the each model proportion to be produced by the Equation 8

$pd_m = \dfrac{d_m}{D}$

where$d_m$ is the product demand in the period $p$ such that $m=1,...,M$; and $D$ is the total demand for all models for the period $p$. The products demand history or the production plan are reference sources for defining the product number of the model $m$.

Step 3: Calculate the cycle time (Tc) based on total production demand to be met by the Equation 2;

$T_{c}=\frac{\text { available time in period p }}{\text { demand inperiod p }}$

Step 4: As mentioned earlier, the RPW-MVM support in times of an equivalent product of mixed AL. Thus, for the tasks allocation in the RPW-MVM, use the Time Weighted Average ($\overline{t_{k}}$) and the weighted average total station time ($\overline{S_{j}}$), calculated using Equations 9 and 10, respectively.

$\overline{t_{k}}=\sum_{m=1}^{M} p d_{m} t_{k, m}$

$\bar{S}_{j}=\sum_{k \in j} \bar{t}_{k}$

where $t_{k, m}$ is the processing time of task $k$ in the model $m$ and $pd_m$ is the proportion of model $m$.

Step 5: Calculate the RPW of each task by adding $\overline{t_{k}}$ to the processing times of all preceding tasks equivalent precedence diagram;

Step 6: Sort the tasks in descending order of RPW;

Step 7: Calculate the minimum number of workstations for balancing ALM (MinW) and then set the last workstation ($W=MinW$) based on the Equations 11 and 12, where $CTT_m$ is the total workload the m model.

$C T T_{m}=\sum_{k=1}^{N} t_{k, m}$

$MinW = \dfrac{CTT_m}{T_c}, m = 1, ... M$

Step 8: Set $j = W$;

Step 9: Calculate the moving target of the latest workstation for all models $(MVM_{j, m = 1, ...M})$. The MVM is required for each product model and should be recalculated every new balanced workstation during application of the RPW-MVM. The moving target the $j^{th}$ workstation to the model $m (MVM_{j, m})$ is calculated by Equation 13 based on the not yet allocated workload residue divided by the total workstations still unbalanced for the m model. Equation 14 sets the total charge allocated at station $j$ of the m model ($CTA_{j, m}$).

$CTA_{j, m} = CTA_{j+a,m} + S_{j,m}$

$MVM_{j,m} = \dfrac{CTT_m - CTA_{j+1,m}}{MinW - (MinW-j)}$

Step 10: Allocate most task $RPW$ to the station $j$, while respecting the precedence relation of the equivalent diagram of precedence, and the weighted average total station time [so that it does not exceed the largest $MVM (\bar{S}_{j} \leq (major MVM_{j,m=1,...M}))]$; Furthermore, pay attention to that the total time m model at the station does not exceed the cycle time $(S_{j,m=1,..M} \leq T_C)$;

Step 11: Repeat the process designating the task to stations until there is no feasible task to at least one of the models;

Step 12: Set $(j = j -1)$ e recalculate $MNM_{j,m=1,...M}$;

Step 13: Validate the inequality $((major AVM_{j,m=1,....M) \leq T_C})$; if met, proceed to the next step; otherwise, return to step 8, reset $(MinW = MinW + 1)$ and restarting the task allocation process; and

Step 14: Repeat steps 10 through 13 until all of the tasks are allocated.

Balancing assessment generated by the RPW-MVM

The balancing analysis of the resulting RPW-MVM heuristic relies on static indicators, ie without the use of dynamic simulation methods. Thus, in some cases, they are calculated in the AL bottleneck position (g), where production is limited according to Peinado & Graeml (2007). The indicators are: (i) the amount of AL workstations; (ii) capacity in the bottleneck situation (Cap_b), as depicted in Equation 15; and (iii) crossing time estimated in the bottleneck position (TCestm_b); (iv) Line Efficiency bottleneck situation (LE_b) and (v) balancing efficiency (BE).

$Cap_b = \dfrac{\text{available time in the period p}}{T_g}$

Where $T_g$ is the bottleneck processing time, defined by the major $S_{j = 1, ...W, m=1,....M}.$

Likewise, the crossing time estimated by the bottleneck situation ($TCestim_b$), shown in Equation 16 also uses the bottleneck processing time in obtaining it.

$TCestim_b = (\text{Number of workstations + A}) \times T_g$

where A is the number of products not allocated to workstations, but located between the beginning and the end of AL (eg, buffers).

Line Efficiency bottleneck situation (LEb) is calculated by Equation 17, whereas the balancing efficiency (BE) is given by Equation 18.

$LE_b = \dfrac{\sum_{k = 1} ^ {N} \overline t_k}{W \times T_s}] \times 100$

$BE = [1- \dfrac {\sum_{j = 1} ^ {W} |\overline S_{j} - S_{av}|} {W \times S_{av}} ] \times 100$

The method was applied in a AL belonging to a manufacturer of agricultural machines of the type drawn with unit manufacturing lot. The AL is organized into five workstations; in each station there is an operator. Moreover, among the workstations there is a buffering unit that has the function of absorbing excess processing time for some models about the cycle time. Figure 9 illustrates the AL current flow, with the number of workstations within the marked blocks and buffers marked with "x" in the center. All computational procedures were performed in spreadsheet.

Figure 9 AL flowchart with current balance. Source: The authors.

The AL in study manufactures seven models of products, called CL, O, MX, CB, ATI, ATU and CH, which are assembled through up to 29 different tasks depending on the model. Table 1 shows the product models, the tasks of each workstation and the precedence relationship.

Table 1 Performed tasks in the AL for each modelthe current AL workload is shown in Figure 10, with the times (in minutes) per workstation and model.

		PRODUCT MODEL
		CL	O	MX	CB	ATI	ATU	CH
Taks		2%	3%	1%	34%	4%	54%	1%	$\overline t_{k}$	RPW
1	Introduce pre-assembly	0.37	0.37	0.37	0.37	0.37	0.37	0.37	0.37	0.37
2	Preassemble servostat	4.49	4.49	0.00	4.49	4.49	4.49	4.49	4.44	4.81
3	Mount Steering Column	0.00	5.59	5.59	5.59	3.40	8.77	5.59	7.08	7.44
4	Preassemble reservoir	3.50	3.50	0.00	3.50	3.50	3.50	3.50	3.46	3.82
5	Preassemble accelerator pedal	3.99	3.99	3.99	3.99	3.99	3.99	0.00	3.94	4.31
6	Place preassembly device at post	0.99	0.99	0.99	0.99	0.99	0.99	0.99	0.99	20.28
7	Preassemble the console structure	0.65	0.65	1.25	1.25	1.25	1.25	1.25	1.22	21.50
8	Preassemble servostat at column	3.42	1.47	0.00	2.29	2.29	2.29	2.29	2.26	23.77
9	Pre-mount clutch cable	0.56	0.56	0.56	0.56	0.56	0.56	0.00	0.55	22.05
10	Pre-mount brake pedals support	0.96	0.96	0.00	0.96	0.96	0.96	0.00	0.94	22.44
11	Mount Valve Brake POWERFILL - 40Km	0.00	0.00	0.00	0.00	0.00	0.00	2.08	0.02	21.53
12	Mount brake valve and reservoir	2.08	2.08	0.00	2.08	2.08	2.08	0.00	2.03	24.47
13	Pre-mount brake sensor	0.47	0.47	0.00	0.47	0.47	0.47	0.00	0.46	24.93
14	Mount switch differential lock	0.52	0.52	0.52	0.52	0.52	0.52	0.52	0.52	22.03
15	Mount clutch pedal	0.97	0.97	0.97	0.97	0.97	0.97	0.00	0.96	23.01
16	Mount accelerator pedal	0.93	0.93	0.93	0.93	0.93	0.93	0.47	0.93	22.43
17	Pre-mount plugs from the brake lines	0.80	0.80	0.16	0.80	0.80	0.80	1.58	0.80	25.30
18	Mount Steering Column on the console	0.00	1.89	1.35	1.35	1.52	5.68	1.52	3.68	27.45
19	Assemble Hydraulic Hoses Direction	5.44	5.44	5.44	5.44	5.44	5.44	5.44	5.44	32.89
20	Assemble hoses servostat	3.56	3.56	6.07	10.88	6.07	6.07	6.07	7.55	31.31
21	Assemble hose and return pipe	3.03	3.03	0.00	3.03	4.55	4.55	4.55	3.90	38.89
22	Mount servostat hoses clamp	0.99	0.99	0.82	0.99	0.99	0.99	0.99	0.99	39.88
23	Assemble steering wheel on the console	0.84	0.84	0.84	0.84	0.84	0.84	0.84	0.84	28.29
24	Plase devide in horizontal position	0.68	0.68	0.68	0.68	0.68	0.68	0.68	0.68	39.58
25	Mount firewall plate	2.14	2.18	3.10	3.10	3.10	3.10	3.10	3.05	41.94
26	Mount firewall nuts clips	0.55	0.55	0.55	0.55	0.55	0.55	0.55	0.55	42.49
27	Seal outside on the console	0.00	0.00	1.39	1.39	1.39	1.39	1.39	1.31	43.80
28	Plase devide upright	0.96	0.96	0.96	0.96	0.96	0.96	0.96	0.96	44.76
29	Final test	3.10	3.10	3.10	3.10	3.10	3.10	3.10	3.10	63.03

After increasingly ordering the tasks in accordance with the value of the RPW, it was determined the number of the last workstation (W). To do this, we calculated the minimum number of workstations for each model (Equation 12), and then it was defined as a worst case model with higher MinW (in this case, the ATU model, according to Table 4).

Table 4 W calculation.

	PRODUCT MODEL
	CL	O	MX	CB	ATI	ATU	CH
CTTm	46.0	51.6	39.6	62.1	56.8	66.3	52.3
TC	12.97	12.97	12.97	12.97	12.97	12.97	12.97
MinW	3.55	3.98	3.06	4.79	4.38	5.11	4.03
	6
W=j	6

Further, steps 9 were performed by 14 of the method presented in section 3. The values of $MVM_{j,m}$ are shown in Table 5; stands out in bold the value of $MVM_{j,m}$ according to $j$ allocation of tasks to workstations.

Table 5 Results of $MVM_{j,m}$.

		PRODUCT MODEL
		CL	O	MX	CB	ATI	ATU	CH
	MinW	6	6	6	6	6	6	6
	CTTm	46.0	51.6	39.6	62.1	56.8	66.3	52.3
j = 6	CTAj+1	0	0	0	0	0	0	0
	AVMm	7.7	8.6	6.6	10.3	9.5	11.0	8.7
j = 5	CTAj+1	8.4	8.5	10.6	10.8	10.8	10.8	10.8
	AVMm	7.5	8.6	5.8	10.3	9.2	11.1	8.3
j = 4	CTAj+1	18.2	18.2	16.2	20.5	22.0	22.0	22.3
	AVMm	7.0	8.3	5.9	10.4	8.7	11.1	7.5
j = 3	CTAj+1	23.5	23.6	24.1	33.2	29.9	29.9	31.3
	AVMm	7.5	9.3	5.2	9.6	9.0	12.1	7.0
j = 2	CTAj+1	31.5	31.5	26.9	41.4	38.2	42.4	35.6
	AVMm	7.3	10.1	6.4	10.4	9.3	11.9	8.4
j = 1	CTAj+1	33.6	39.2	35.3	49.7	44.4	53.9	44.0
	AVMm	12.3	12.3	4.4	12.3	12.3	12.3	8.4

The new balance of AL is shown in Figure 12, with the times per workstation and per model.

Figure 12 New balance of AL. Source: The authors.

It can be seen in Figure 12, all workstations have less processing time than the cycle time. Thus, the new balancing provided the AL able to produce 37 products/turn, regardless of the proportion or type of product manufacture. A summary of the tasks allocation to the workstations is shown in Chart 1. As can be seen, there was an increase of 1 workstation from the current balance; however, all workstations have processing time less than the cycle time, which ensures a production capacity of 37 products/shift for any model.

Chart 1 Tasks allocation to workstations for balancing the AL.

Workstation	Task
1	1; 2; 4; 5
2	3; 6; 7; 14
3	8; 9; 10; 12; 16; 18
4	11; 15; 20; 23
5	13; 17; 19; 21
6	22; 24; 25; 26; 27; 28; 29

Another observed improvement refers to buffers which become dispensable for no longer exists over processing time in relation to the cycle time for any model. Thus, the amount of product in the new AL will not exceed the number of workstations (6); this situation differs from the current balance, which allows up to 9 products in the AL. So you can see a 33% reduction of inventory in process. Table 6 presents the variables and indicators used to assess the current state of the AL compared to new balance.

Table 6 Variables and Indicators (Current × RPW-MVM).

		Current balancing	New balancing
VARIABLE	Time available in the period p (min)	480	480
	Demand (parts)	37	37
	Cycle time (min)	12.97	12.97
	Number of buffers	4	0
	Model bottleneck	ATU	CB
	Tg (min)	17.12	12.69
	CTTg (min)	66.3	62.1
INDICATOR	Amount of AL workstations	5	6
	Capg (parts)	28.0	37.8
	TCestimg (min)	154.08	76.14
	Line efficiency bottleneck situation (LEg)	63%	83%
	Balancing efficiency (BE)	85%	94%

The results presented in Table 6 indicate significant improvements from the point of view of the company's experts. The ability of 37 products/shift exceeded the capacity index of the current state by 35% for the AL bottleneck model. This increase is due to the new distribution of tasks. Furthermore, the new balancing allows the release of the products in AL without particular sequence, which gives great flexibility to the system.

The crossing time estimated in the bottleneck situation was reduced by 50%, which represents that a product can reach the customer 78 minutes faster than today. Finally, the line Efficiency bottleneck situation showed an improvement of 32% under the influence of reduction in processing time bottleneck station (due to rebalance). The balancing efficiency improved 11% (from 85% to 94%), resulting in a better balanced distribution of tasks between the workstations about to the current balance.

Finally, a comparison was performed between the resulting RPW-MVM balancing against traditional RPW applied to mixed-AL, according to Table 7. The flexibility of precondition for a demand for 37 products per shift was not met for the case of balancing proposed by traditional RPW, as capacity in the bottleneck situation was 31.4 products/ shift. Moreover, a reduction in line efficiency at bottleneck situation was observed, despite the reduction of a workstation having occurred, along with the increase in 4% balancing efficiency.

Table 7 Variables and Indicators (RPW-MVM × RPW).

		New balancing RPW-MVM	New balancing RPW
VARIABLE	Time available in the period p (min)	480	480
	Demand (parts)	37	37
	Cycle time (min)	12.97	12.97
	Number of buffers	0	0
	Model bottleneck	CB	CH
	Tg (min)	12.69	15.28
	CTTg (min)	62.1	52.32
INDICATOR	Amount of AL workstations	6	5
	Capg (parts)	37.8	31.4
	TCestimg (min)	76.14	76.38
	Line efficiency bottleneck situation (LEg)	83%	82%
	Balancing efficiency (BE)	94%	98%