When a transfer line consisting unrelaible machines and finit storage buffers, blocking can happen. An optimal storage buffer scheme is designed to minimize the blocking cost with resonable small buffering cost. We apply a nondominated sorting to this problem and achieve multi-objective optimization. (The work was done in 1999)