Global Optimality in Process Plan Selection Problem

Due to accessibility of alternative machines, tools, fixtures and other auxiliary devices,there are multiple process plans for each part and process plan selection problem (PPSP)is one of the most important decision-making problems in manufacturing environments. Many researchers have recently attempted this issue and proposed some models for optimum process plan selection problem. In this article, PPSP is formulated as a linear mathematical programming model with binary variables. Then a Branch-and-Bound algorithm is developed to find a global optimum solution for this problem. Some benchmark problems are solved through proposed Branch-and-Bound algorithm and results are compared with the literature.