The Solution of Multi - Objective Multimode Resource -Constrained Project Scheduling Problem with Multi -Objective Bees Metaheuristic Algorithm
Author(s):
Abstract:
Resource Constrained Project Scheduling Problem (RCPSP) is the most general scheduling problem. Job shop scheduling, flow shop scheduling and other scheduling problems are the subsets of RCPSP. The present paper examines the multimode multi-objective resource constrained project scheduling problem (RCPSP) with partial precedence relations. To enhance the practical aspects of this prominent problem, important practical purposes including minimizing the completion time of the project, maximizing the quality of project activities and minimizing the total cost of the project were considered. After validation of the model using the Bees Algorithm, the proposed multi-objective model was solved. The results obtained from the proposed model were compared with those obtained from NSGA-II. The results demonstrated the good performance of the proposed algorithm in solving RCPSPs.
Keywords:
Project scheduling , Resource constraints , Multi , objective , RCPSP , MOBEE algorithm , NSGA , II
Language:
Persian
Published:
Journal of Strategic Management in Industrial Systems, Volume:10 Issue: 34, 2016
Page:
1
magiran.com/p1563221
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!