CREDIBILITY-BASED FUZZY PROGRAMMING MODELS TO SOLVE THE BUDGET-CONSTRAINED FLEXIBLE FLOW LINE PROBLEM

Abstract:
This paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. Since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzzy) in practice, they are treated as fuzzy variables. Furthermore, to investigate the model behavior and to validate its attribute, we propose three fuzzy programming models based upon credibility measure, namely expected value model, chance-constrained programming model and dependent chance-constrained programming model, in order to transform the original mathematical model into a fuzzy environment. To solve these fuzzy models, a hybrid meta-heuristic algorithm is proposed in which a genetic al- gorithm is designed to compute the number of processors at each stage; and a particle swarm optimization (PSO) algorithm is applied to obtain the op- timal value of tardiness variables. Finally, computational results and some concluding remarks are provided.
Language:
English
Published:
Iranian journal of fuzzy systems, Volume:9 Issue: 6, Dec 2012
Page:
1
magiran.com/p1110600  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!