Mathematical Problems in Engineering

Research Article

A Mathematical Model and a Simulated Annealing Algorithm for Balancing Multi-manned Assembly Line Problem with Sequence-Dependent Setup Time

Table 3

An example of the procedure to build a feasible balancing solution for the MALBPS-I.
StartStep 1Step 2Step 3Step 4Step 5Step 6
, AT = [1]Select task1Randomly select a worker 1 in station1; then,   
  AT = [2,4]Select task2Calculate the earliest start time for all workers as min[1,1] = 1; then, randomly select a worker 2 in station 1,   
  AT = [3,4,5]Select task5Calculate the earliest finishing time for all workers as min[6,6] = 6; then, randomly choose worker 2,  = 11.14 > 7; then, check station 1  
      = 4, UB = 1.02, , L = 2, R = 0.543 < Exp (, accept the assignment; then,  
 AT = [3,4,5]Select task5Randomly select a worker 1 in station2; then,   
  AT = [3,4,6]Select task3Calculate the earliest start time for all workers as min[5,0] = 0; then, select worker 2; ;.  
  AT = [4,6]Select task4Calculate the earliest start time for all workers as min[5,4] = 4; then, select worker 2;; then, check station 2  
      = 2.5, UB = 1.02, L = 2, R = 0.824 < Exp (, accept the assignment; then,  
 AT = [4,6]Select task4Randomly select a worker 1 in station3 then,   
  AT = [6,7]Select task6Calculate the earliest start time for all workers as min[3,0] = 0; then, select worker 2.;   
  AT = [7]Select task7Calculate the earliest start time for all workers as min[3,6] = 3; then, select worker1, ; then, check station 3 = 2.5, UB = 1.02, L = 2, R = 0.746 < Exp (, accept the assignment; then,  
 AT = [7]Select task7Randomly select a worker 1 in station4; then,  All tasks are assigned