Two-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect

Abstract:
This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associated with the machine purchase. Based on the made decisions, the second stage aims to schedule orders, while the objective is to minimize total tardiness costs. A dependent-chance programming (DCP) approach is used for the defuzzification of the proposed model. As the resulted formulation is a NP-hard problem, a branch and bound (B&B) algorithm with effective lower bound is developed. Moreover, a genetic algorithm (GA) is proposed to solve problems of large-sizes. The computational results reveal the high efficiency of the proposed methods, in particular the GA, to solve problems of large sizes.
Language:
English
Published:
Journal of Industrial and Systems Engineering, Volume:10 Issue: 3, Summer 2017
Pages:
16 to 32
magiran.com/p1746030  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!