Branch and Bound Algorithm to Select the Best Process Plan in an Automated Manufacturing Environment
عنوان مقاله: Branch and Bound Algorithm to Select the Best Process Plan in an Automated Manufacturing Environment
شناسه ملی مقاله: ICME10_206
منتشر شده در دهمین کنفرانس ملی مهندسی ساخت و تولید در سال 1388
شناسه ملی مقاله: ICME10_206
منتشر شده در دهمین کنفرانس ملی مهندسی ساخت و تولید در سال 1388
مشخصات نویسندگان مقاله:
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
خلاصه مقاله:
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
In flexible manufacturing environment, several process plans can be considered to manufacture a part. Thus, a process planner has to select the best process plan for a set of parts, among the existing competitive plans. This paper formulates process plan selection problem as a mixed integer programming model and develops a branch and bound algorithm to find a global optimum solution for this problem. The objective function of the proposed model is to minimize the sum of total cost associated with the processing times and number of process steps and the dissimilarity cost between the selected plans.
کلمات کلیدی: Process planning – Mixed integer programming - Branch and bound
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/81844/