Research Article

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

Table 1

Notations.

Indices
i, h, p, mA task
kA worker
jA multimanned station
nThe total number of tasks
M:A big number
CtThe given cycle time
fstipThe forward setup time between task i and task p
bstipThe backward setup time between task i and task p
WmaxThe maximum allowed number of workers in one station
SmaxThe upper bound of number of multimanned station
NmaxThe maximum allowed number of tasks for each worker
P(i)Set of all immediate predecessors of task i
Pa(i)Set of all predecessors of task i
S(i)Set of all immediate successors of task i
Sa(i)Set of all successors of task i
WSkSet of tasks assigned to worker k
θA controlling parameter between 0 and 1

Parameters
ISet of tasks I = 1, 2, 3, … n, m
KSet of workers K = 1, 2, 3, … Wmax
JSet of stations J = 1, 2, 3, … Smax
WSSet of positions WS = 1, 2, 3, … Nmax
tiThe task time of task i

Decision variables
xijks1, if task i is assigned to the position s of station (j, k); 0, otherwise
ftiThe finish time of task i
1, if at least one task is assigned to station (j, k); 0, otherwise
WSjk1, if k workers are used in station j; 0, otherwise

Indicator variables
zipjk1, if task i is assigned to the immediately predecessor position of task p in station (j, k); 0, otherwise
ltijk1, if task i is assigned to the last position of station (j, k); 0, otherwise