抄録
In manufacturing, process planning considers how the order in which a product is manufactured affects elements such as machining time, power consumption and quality of the final product. However, it is common that a large number of tools and processes are required for the completion of a product, therefore the number of possible processing sequences can be enormous. It is impossible to quickly select the most suitable processing sequence in such cases. Therefore, we solve the problem of deciding the processing sequence in manufacturing using solutions obtained by a k-Shortest Paths algorithm. We develop a decision support system that can evaluate the efficiency of each processing sequence according to the criteria desired.
