Process sequencing and process clustering in process planning using state space search

Abstract

Process sequencing, as a very important part of process planning, has been the subject of many research reports in the area of process planning, but is usually treated as a feature-sequencing problem. This paper presents a novel algorithm for process sequencing, which considers the feature precedence network, different process candidates, and machine and tool constraints. The algorithm consists of two parts: process clustering and process sequencing. For clustering we used a notion of the same resource usage for different features, while for sequencing we applied the best-first search method algorithm to generate an optimal process sequence. The algorithm has been applied on several examples with realistic complexities, and it showed satisfactory results.