Process sequencing represents one of very important tasks in the process planning. The order of tasks and the use of resources are determined by sequencing, and therefore the decision carries the burden of finally optimizing the whole process plan of the part. This paper proposes a flexible, agent-based framework for process sequencing which allows for realtime selection of the sequencing algorithm, dependent on the stage of the product development. The framework has been developed around a tool called space searcher which provides for application of space search algorithms in various domain. Space searcher receives a sequencing agent which provides the sequencing algorithm and executes a space search in order to generate context-specific optimal process sequence. Several process sequencing algorithms (and corresponding agents for space searcher) are described in detail. The application of those algorithms is illustrated on few examples.

This content is only available via PDF.
You do not currently have access to this content.