Scheduling of jobs and maintenance activities in an unrelated parallel machines environment

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Scheduling of jobs and maintenance activities is a vital problem in a production system. In the current business environment, the competitiveness of manufacturing companies is based on their ability to response the rapid changes in demand with high quality and low costs. Therefore. in this paper, the Scheduling of jobs and maintenance activities in an unrelated parallel machines environment is studied. By considering the controllable processing times, a multi-objective mathematical programming model is presented to minimize the sum of the compression and expansion of processing times and maintenance costs, makespan, tardiness, and earliness. The multi-choice goal programming (MCGP) is applied. The problem is NP-hard, therefore, the NSGA-II algorithm is developed to solve the medium and large size instances. The obtained results from solving the proposed model with NSGA-II and comparing with the results from MCGP demonstrates that the proposed algorithm is presented a non-dominated solution set in a short time.
Language:
Persian
Published:
Journal of Modeling in Engineering, Volume:17 Issue: 58, 2019
Pages:
233 to 247
magiran.com/p2152358  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!