نوع مقاله : مقاله پژوهشی
نویسندگان
1 کارشناسی ارشد مدیریت صنعتی دانشگاه اصفهان
2 استادیار گروه مدیریت دانشگاه اصفهان
3 استادیار گروه مدیریت صنعتی دانشگاه شهید بهشتی
چکیده
در این پژوهش مدل ریاضی جهت زمانبندی پروژههایی با محدودیت منابع در حالت چند مد و با هدف بیشینه سازیNPV ارائه شده است. مدل ارائه شده برگرفته از مسئله MRCPSP- GPRمیباشد. در این پژوهش ابتدا یک مدل ریاضی که قادر به ارائه جواب دقیق باشد جهت حل نمودن مسائل MRCPSP- GPRارائه خواهد شد، سپس مدل برای محاسبه هزینه اضافه کاری، در نظر گرفتن جریمه دیرکرد، پاداش زودکرد و تاثیر آن برروی NPVپروژه تعمیم مییابد. در نظر گرفتن هزینههای اضافه کاری و پاداش و جریمه زمان تحویل به طور همزمان در تصمیمگیری، زمانبندی و مقدار واقعی NPV پروژه تاثیر بسیاری خواهد داشت. برای نزدیکتر شدن نتیجه مدل به شرایط واقعی، دو سیاست پرداخت کلاسیک در قالب تابع هدف مدل ارائه شده است. جهت اثبات عملکرد مدل یک مسئله استاندارد با دو سیاست پرداخت مدلسازی و حل شده است. در نهایت، 36 نمونه پروژهی استاندارد با سایزها و پارامترهای مختلف توسط مدل زمانبندی شده و نتایج آن مورد تحلیل قرار گرفت.
کلیدواژه‌ها
عنوان مقاله [English]
A new model for the multi-mode resource-constrained project scheduling problem with discount cash flows
نویسندگان [English]
- Amine Keramaty 1
- Majid Esmaelian 2
- Masoud Rabieh 3
چکیده [English]
This paper presents a mathematical model for the multi-mode resource-constrained project scheduling problem with maximizing the net present value of project. The proposed model is inspired by MRCPSP-GPR. Firstly, we presented an exact model solving MRCPSP_GPR then we expanded the model to estimate other cost-related options, penalty-related expenditure is a case in point. As a result of estimating different factors which impact on project scheduling such as reward and penalty of finishing the project, managers can efficiently make a better decision. For better adaptation with real conditions, we consider two payment methods in two objective functions. The adjusted schedule by proposed model and solving time was logical. Moreover, to verify the proposed model, a numerical example is solved in small size and the related computational results are illustrated in terms of schedules. In addition, computational results with a set of 36 test problems in various sizes are reported and the results analyzed.
کلیدواژه‌ها [English]
- Rectangle packing
- Multi mode
- Payment Methods
- Costs of overtime
- Net present value
Bey, R. B., Doersch, R. H., & Patterson, J. H. (1981). The net present value criterion: its impact on project scheduling. Project Management Quarterly, 12(2), 35-45. Besiksikci, U., Bilge, U., & Ulusoy, G. (2015). Multi-mode resource constrained multi-project scheduling and resource portfolio problem. European Journal Of Operation Research, 240(1), 22-31.
Chen, W. N., & Zhang, J. (2012). Scheduling Multi-Mode Projects under Uncertainty to Optimize Cash Flows: A Monte Carlo Ant Colony System Approach. Journal of Computer Science and Technology, 27(5), 950-965.
Cheng. Z., Fowler, J., Kempf, K., Mason, S. (2015) multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computer & Operation Research Journal, 53(1), 275-287.
Coelho, J., & Vanhoucke, M. (2011). Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. European Journal of Operational Research, 213(1), 73-82.
Huang, W., Chen, D., & Xu, R. (2007). A new heuristic algorithm for rectangle packing. Computers & Operations Research, 34(11), 3270-3280.
Icmeli, O., & Erenguc, S. S. (1996). A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows. Management Science, 42(10), 1395-1408.
Klein, R. (2000). Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. European Journal of Operational Research, 127(3), 619-638.
Kolisch, R. (1996). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90(2), 320-333.
Mika, M., Waligóra, G., & Węglarz, J. (2005). Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 164(3), 639-668.
Russell, A. H. (1970). Cash flows in networks. Management Science, 16(5), 357-373.
Sabzehparvar, M., & Seyed-Hosseini, S. M. (2008). A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. The Journal of Supercomputing, 44(3), 257-273.
Seifi, M., & Tavakkoli-Moghaddam, R. (2008). A new bi-objective model for a multi-mode resource-constrained project scheduling problem with discounted cash flows and four payment models. Int. J. of Engineering, Transaction A: Basic, 21(4), 347-360.
Shadrokh, S., & Kianfar, F. (2007). A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research, 181(1), 86-101.
Ulusoy, G., & Cebelli, S. (2000). An equitable approach to the payment scheduling problem in project management. European Journal of Operational Research, 127(2), 262-278.
Ulusoy, G., Sivrikaya-Şerifoğlu, F., & Şa in, Ş. (2001). Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows. Annals of Operations Research, 102(1-4), 237-261.
Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2001). On maximizing the net present value of a project under renewable resource constraints. Management Science, 47(8), 1113-1121
)