سال انتشار: ۱۳۸۹

محل انتشار: ششمین کنفرانس بین المللی مدیریت پروژه

تعداد صفحات: ۱۰

نویسنده(ها):

F.S. Kazemi – M.Sc in Department of Industrial Engineering, College of Engineering, University of Tehran,
R. Tavakkoli-Moghaddam – Professor in Department of Industrial Engineering College of Engineering, University of Tehran,

چکیده:

This paper presents a multi-objective multi-mode resource-constrained project scheduling problem (MRCPSP) with positive and negative cash flows. We consider the objectives of the net present value (NPV) maximization and robustness maximization along by makespan minimization. Furthermore, to make a model close to the real world situations, two types of commonly used payment models are considered. We present a mathematical model for the given problem and solve it by the Lingo 8 software. In addition, we use the nondominated sorting genetic algorithm II (NSGA-II) in order to solve the proposed model. Finally, the computational results for a set of test problems taken from the project schedulingproblem library (PSPLIB) are presented and discussed.