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

<div>The optimal task assignment to stations of multi-manned assembly lines without setup time (result (a)) and with setup time (result (b)) for Merten problem.</div>

Mathematical Problems in Engineering

fig3

Figure 3

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

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