FLOW TIME MINIMIZING METHOD IN PERMUTATION FLOW SHOP

摘要

PROBLEM TO BE SOLVED: To improve productivity of a system and its efficiency by generating an optimum schedule for minimizing flow time as one of system performance. SOLUTION: An initial solution is generated, f(X) is calculated and BEST- ID =K and BEST- F=(X) are conditioned. The conditions of NO=NO+1 and K=1 are determined, and a variable OFA is defined as a large value MAX. In the case of Kn, a schedule Xk excluding a work K is generated from the current solution K, and f(Xk ) is calculated. In the case of OFAf(Xk ), the preceding stage of K=K+1 is recovered. A schedule X-a is generated and on the condition of L=1, a parameter OFB is defined as a large value MAX. In the case of Ln, the condition of Y=Xa ,b is generated, f(Y) is calculated and on the condition of f(X)f(Y) and BEST- Ff(Y), it is replaced with BEST- ID=Y and BEST- F=f(Y). A random number R belongs to (0, 1) is generated by the replacement with X=Y and f(X)=f(Y) and the condition of P(A)=exp(-(f(X)-(f(Y)/Ck ) is found.