Non-dominated Sorting Genetic Algorithm-II to Solve Multi Objective Resource-constrained Project Scheduling Problem with Time-cost Trade-off
(ندگان)پدیدآور
Ebrahimi Fard, SoniaNahavandi, NasimHosseinzadeh Kashan, Aliنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
Scheduling plays an important role in project management. However, in addition to providing suitable scheduling, constraints during project implementation should also be noted. This paper proposes bi-objective resource-constrained project scheduling model with the objectives of minimizing project completion time, as well as minimizing the leveling cost of the used resources, in accordance with the employer demands and the contractor developed. To better study this model performance, a real case study related to the topic, were selected. Since the proposed research problem has been proven to be NP-hard as well as large-scale case study, after analyzing the landscape, genetic algorithm to solve problem were offered. Finally, the results of solving real-world algorithms were compared with the results. Results show that the model and algorithm can be used in other similar projects as well.
کلید واژگان
Non-dominated sorting Genetic algorithm (NSGA-II)Resource constrained project scheduling problem (RCPSP)
Resource leveling
Operation Research and Project Management
شماره نشریه
4تاریخ نشر
2018-01-011396-10-11
ناشر
University of Tehranشاپا
2423-68962423-6888




