Investigating operational costs in multi-flexible job shop scheduling problem: Two multi-objective evolutionary algorithms approach

سال انتشار: 1391
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,216

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

این مقاله در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

IIEC09_350

تاریخ نمایه سازی: 26 اسفند 1391

چکیده مقاله:

One of the most important factors in financial calculations of industrial companies is their operational costs of scheduling. In this paper, in order to create a more realisticmodel and get closer to real world issues of flexible job shop scheduling problem (FJSP), one operational factor will be addedto classical FJSP. Optimization of operational costs due to production schedules is aim of the factor added. Another objective, considered in this study, is total work load which is a crucial factor in controlling and boosting production scheduling. Since in the literature of multi-objective flexible job shopscheduling problem (MOFJSP), this is known as an NP-hard problem, two multi-objective evolutionary algorithms, including controlled elitism non-dominated sorting genetic algorithm(CONSGA) and non-dominated sorting genetic algorithm (NSGAII) were adopted for MOFJSP. At the end, by developing well-known problems of the FJSP, we studied the performance of the proposed algorithms. The results obtained from algorithmswere evaluated by famous metrics of the multi-objective evaluation statistically.

کلیدواژه ها:

flexible job shop scheduling problem ، operating costs of scheduling ، controlled elitism non-dominated sorting genetic algorithm ، Non-dominated sorting genetic algorithm

نویسندگان

A.R Khatami

Islamic Azad University, Qazvin Branch

M. Zandieh

Shahid Beheshti University, G.C

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Brandimarte, P., Routing and scheduling in a flexible job shop ...
  • Hurink, E., Jurisch, B., Thole, M., . Tabu search for ...
  • Scrich, C.R., Armentano, V.A., Lag.una, M., 2004. Tardiness minimization in ...
  • Mastrolilli, M., Gambardella, L.M., 2000. Effective neighborhood functions for the ...
  • _ _ _ _ _ International; 11:223-32 ...
  • Deb, K., Agrawal, S., Pratap, A., Meyarivan, T., 2000, A ...
  • Rahmati S.H.A., Zandieh M., Yazdani M.. Developing two multi- ...
  • Manufacturing Technology, DOI 10. 1 007/s00 170-012-405 1-1, 2012. ...
  • Karimi, N., Zandieh, M., Karamooz, H.R., Bi-objective group scheduling in ...
  • Rahmati, S.H.A., Zandieh, M., . A new biogeography- based optimization ...
  • Kacem, I., Hammadi, S., Borne, P., Approach by localization multi- ...
  • _ _ _ _ Industrial Engineering, 59: 436-447. ...
  • Frutos, Mariano, Olivera, Ana Carolina, Tohm, Fernando, A memetic algorithm ...
  • Fattahi, Parviz, Jolai, Fariborz, Arkat, Jamal, Flexible job shop _ ...
  • Jia HZ, Nee AYC, Fuh JYH, Zhang YF, A modified ...
  • نمایش کامل مراجع