چکیده مقاله
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
کلیدواژهها
نویسندگان
Maghsud Solimanpur
Associate Professor, Faculty of Mechanical Engineering, Urmia University, Iran
Hossein Sattari
Master of Science Student, Faculty of Mechanical Engineering, Urmia University, Iran
Ali Doniavi
Assistant Professor, Faculty of Mechanical Engineering, Urmia University, Iran
Amir Musa Abazari
Master of Science Student, Faculty of Mechanical Engineering, Urmia University, Iran
شیوه ارجاع
Solimanpur, Maghsud and Sattari, Hossein and Doniavi, Ali and Abazari, Amir Musa,1388,Global Optimality in Process Plan Selection Problem,10th Iranian Conference on Manufacturing Engineering (ICME 2010),Babol
ارائهشده در
مجموعه مقالات دهمین کنفرانس ملی مهندسی ساخت و تولید10 اسفند 1388 · بابل