A New Bi-Objective Model for a Multi-Mode Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and four Payment Models
Author(s):
Abstract:
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategies. In this paper, we present a new bi-objective model for the MRCPSP that maximizes the net present value (NPV) and minimizes the holding cost of activities completed by the projects’ completion time. For better adoption with real conditions, we consider four different payment models for positive cash flow. To verify the proposed model, a number of numerical examples are solved in small sizes and the related computational results are illustrated in terms of schedules. Finally, a meta-heuristic algorithm based on simulated annealing (SA) is utilized to solve our four payment proposed models in various sizes and the obtained results were analyzed.
Language:
English
Published:
International Journal of Engineering, Volume:21 Issue: 4, Nov 2008
Page:
347
magiran.com/p575968
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 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!