Project scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
(ندگان)پدیدآور
Zaree, MostafaKamranrad, RezaZaree, MojtabaEmami, Imanنوع مدرک
TextOriginal Article
زبان مدرک
Englishچکیده
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and the total cost is balanced. Given the balance between time and cost, and to achieve these goals, there are several options that should be considered among existing options and ultimately the best option to perform activities to complete the project. In this research, a mathematical model of project scheduling with multiple goals based on cost patterns and consideration of resource constraints is presented, and this problem is considered as a problem for NP-hard issues in family hybrid optimization. GA، PSO and SA Meta-heuristic algorithms are used to solve the proposed model in project scheduling and the results are compared with each other.
کلید واژگان
Project schedulingNPV maximizing
payment patterns
Resource constraints
meta-heuristic algorithms
شماره نشریه
2تاریخ نشر
2020-08-011399-05-11
ناشر
Iran Center for Management Studiesسازمان پدید آورنده
Imam Hossein University of Technology, Tehran, Iran.Department of Industrial Engineering, Faculty of Engineering, Semnan University, Semnan, Iran.
Islamic Azad University of South Tehran, Tehran, Iran.
Department of Industrial Engineering, Eyvanakey University, Eyvanakey, Iran.
شاپا
2476-308X2476-3098




