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

Algorithm 4

Algorithm for models of Min-TLH with constraint.

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

Output: The optimal solution of Min-TLH with constraint.

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

   (1-2) Produce the feasible solution set () of , that is, the set of solutions satisfying constraint.

   (1-3) Obtain the optimal TLH in .

   (1-4) = 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 and .

   (3-2) Produce the feasible solution set () of , that is, the set of solutions satisfying constraint.

   (3-3) Obtain the optimal TLH in .

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

      O = optimal TLH in ;

      ;

      Continue;

       Else

      Break;

(4) Output O.