Routi g and Production Schedulin g for a Mobil e Factory
سال انتشار: 1396
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 548
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-28-3_006
تاریخ نمایه سازی: 20 آبان 1397
چکیده مقاله:
In last decades, mobil e factories have been used due to their high production capability, carrying o ut their eq ipment, and covering rough and uneven routes. Nowadays, more companies use mobile factories w ith the a im of re ducing the transportation and manufactur ng costs. he mobile factory mu st travel between the suppliers, visit all of them in each time per od, and re turn to the initial location of the mobile fact ory. In this paper, we present an integer nonl inear programming m o del for pro uction sche duling and routing of m obile facto ry with the aim of maximization of profit. This problem is similar to the well-kn wn Traveling Salesma n Problem (TSP), which is an NP-hard probl em. In addit ion, for eac h supplier, the sched ling problem for production is NP-h ard. After linearizatio n, we proposed a h euristic gr eedy algo rithm. The efficiency of this he uristic alg orithm is analyzed using the computatio al studies on 540 randomly gen erated test instances. Finally, the sensitivity a nalysis of t he producti on, transpor tation, and relocation costs was conducted.
کلیدواژه ها:
نویسندگان
adele behzad
Industria l Engineering Department, Faculty of E gineering, F erdowsi Univ ersity of Mash had
mohammad ali pirayesh
Industrial Engineerin g Department, Faculty of Engineering, Ferdowsi University of Mashhad
mohammad ranjbar
Industrial Engineering Dep artment, Facu lty of Engine ering, Ferdowsi University of Mashhad