A Heuristic Algorithm in Process Plan Selection Problem

Due to accessibility of alternative machines, tools, fixtures and other auxiliary devices,process plan selection problem (PPSP) is one of the most important decision-making problems in manufacturing environments. Many researches have recently attempted this issue and proposed some models for optimum process plan selection problem. In this article firstly, PPSP is formulated as a non-linear mathematical programming model with binary variables. Then a heuristic algorithm is suggested to find a local optimum solution for the proposed model. The objective function of this model is to minimize the sum of total cost associated with the process plans and the dissimilarity cost between them. Some benchmark problems are solved and results are compared with the literature.