Solving a multi-objective resource-constrained project scheduling problemusing Cuckoo optimizationalgorithm

Message:
Abstract:
Scheduling of a project is one of the most important factors, which has great effects on a project success. In the real world atmosphere, project scheduling problems involve multiple objectives which must be optimized simultaneously. According to the literature, several meta-heuristic algorithms have used single objectiveresource-constrained project scheduling problem,while very few of them have used a multi-objective framework. In this study, we focus on a multi-objective resource-constrained project scheduling problem by minimizing project completion time and time value of project costs, which is the main contribution of the current research. The goal is to provide an algorithm that canfind the optimum Pareto front solutions, using a multi-objective Cuckoo optimization algorithm. In order to increase the efficiency of the algorithm, the algorithm parameters are tuned using Taguchi tests. Finally, the solutions derived from the algorithm have been compared to the ones obtained from NSGA-II. The experimental shows the efficiency of the proposed algorithm.
Language:
English
Published:
Scientia Iranica, Volume:21 Issue: 6, 2014
Pages:
2419 to 2428
magiran.com/p1355542  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 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!