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

Algorithm 1

Algorithm for models of Min-.

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

Output: The optimal solution of Min-.

() 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 .

   (1-2) Obtain the optimal in .

   (1-3) O = optimal in ;

(2) ;

(3) While Do

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

   (3-2) Obtain the optimal in .

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

       = optimal in ;

      ;

      Continue;

      Else

      Break;

(4) Output O.