CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A Heuristic Algorithm in Process Plan Selection Problem

عنوان مقاله: A Heuristic Algorithm in Process Plan Selection Problem
شناسه ملی مقاله: ICME10_204
منتشر شده در دهمین کنفرانس ملی مهندسی ساخت و تولید در سال 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
Amir Musa Abazari - Master of Science Student, Faculty of Mechanical Engineering, Urmia University, Iran.

خلاصه مقاله:
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.

کلمات کلیدی:
Process plan selection – Heuristic algorithm

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/81842/