Near optimal assembly sequence generation

Novel near optimal algorithm is proposed in order to compute assembly sequence with practical computation time. The proposed algorithm guarantees linear increase of computation time with regard to number of candidate assembly processes. Computation time and objective function values with respect to search space size are examined with a practical assembly product.