Search heuristics for operation sequencing in process planning

The operation-sequencing problem in process planning is considered to produce a part with the objective of minimizing the sum of machine, setup and tool change costs. In general, the problem has combinatorial characteristics and complex precedence relations, which makes the problem difficult to solve. Six local search heuristics have been developed based on simulated annealing and tabu search to obtain good solutions for practical-sized problems within a reasonable amount of computation time. Application of the algorithms is illustrated using an example part. Also, computational experiments were done on randomly generated problems and the results show that the tabu search-based algorithms are better than the simulated annealing-based algorithms on overall average. In particular, one of the tabu search algorithms suggested here gave optimal solutions for most small-sized test problems within every short computation times.