Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect

Algorithm 1

Procedure of the proposed CSA.

Input initial and final temperature, (, and annealing index λ.

Randomly generate a solution, improved by (Johnson’s rule based) _mean, then by a

pairwise interchange, denote the solution , Calculate .

Do while

Set , , and .

Let, , and.

Let where eps <.

Let .

Set .

Do while (, a predetermined number of iteration is set at 20)

Choose i and j randomly with , swap the th

job and jth job in to obtain a new solution .

Calculate the makespans and .

If , then replace by; else, replace by when

, where

U~rand(0, 1).

Let.

End while

Let and .

End while

Output a final solution .