Research Article
Formulations, Features of Solution Space, and Algorithms for Line-Pure Seru System Conversion
Algorithm 2
Algorithm for models of Min-
with TLH constraint.
Input: (the number of workers in assembly line). | Output: The optimal solution of Min- with TLH 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 | and TLH. | (1-2) Produce the feasible solution set () of , that is, the set of solutions satisfying TLH constraint. | (1-3) Obtain the optimal in . | (1-4) 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 | and TLH. | (3-2) Produce the feasible solution set () of , that is, the set of solutions satisfying TLH constraint. | (3-3) Obtain the optimal in . | (3-3) If optimal in < optimal in Then | O = optimal in ; | ; | Continue; | Else | Break; | (4) Output O. |
|