Formulations, Features of Solution Space, and Algorithms for Line-Pure Seru System Conversion

Algorithm 3

Algorithm for models of Min-TLH.

Input: (the number of workers in assembly line).

Output: The optimal solution of Min-TLH.

(1) Initialize. Set O = null (record the optimal solution), .

   (1-1) Generate the solution set () of sub-space with J serus according to ! and calculate each solution’s TLH.

   (1-2) Obtain the optimal TLH in .

   (1-3) O = optimal TLH in ;

(2) ;

(3) While Do

   (3-1) Generate the solution set () of sub-space with J serus according to ! and calculate each solution’s TLH.

   (3-2) Obtain the optimal TLH in .

   (3-3) If optimal TLH in < optimal TLH in Then

          O = optimal TLH in ;

          ;

         Continue;

        Else

         Break;

(4) Output O.