Nabipoor Afruzi, Elham, Aghaie, Abdollah. (1398). A Hybridized Metaheuristic Algorithm to Solve the Robust Resource Constrained Multi-Project Scheduling Problem. نشریه مهندسی عمران امیرکبیر, 51(1), 15-32. doi: 10.22060/miscj.2019.15033.5121
Elham Nabipoor Afruzi; Abdollah Aghaie. "A Hybridized Metaheuristic Algorithm to Solve the Robust Resource Constrained Multi-Project Scheduling Problem". نشریه مهندسی عمران امیرکبیر, 51, 1, 1398, 15-32. doi: 10.22060/miscj.2019.15033.5121
Nabipoor Afruzi, Elham, Aghaie, Abdollah. (1398). 'A Hybridized Metaheuristic Algorithm to Solve the Robust Resource Constrained Multi-Project Scheduling Problem', نشریه مهندسی عمران امیرکبیر, 51(1), pp. 15-32. doi: 10.22060/miscj.2019.15033.5121
Nabipoor Afruzi, Elham, Aghaie, Abdollah. A Hybridized Metaheuristic Algorithm to Solve the Robust Resource Constrained Multi-Project Scheduling Problem. نشریه مهندسی عمران امیرکبیر, 1398; 51(1): 15-32. doi: 10.22060/miscj.2019.15033.5121

A Hybridized Metaheuristic Algorithm to Solve the Robust Resource Constrained Multi-Project Scheduling Problem

AUT Journal of Modeling and Simulation
مقاله 2، دوره 51، شماره 1، شهریور 2019، صفحه 15-32    اصل مقاله (1.55 M)
نوع مقاله: Research Article
شناسه دیجیتال (DOI): 10.22060/miscj.2019.15033.5121
نویسندگان
Elham Nabipoor Afruzi1؛ Abdollah Aghaie* 2
1Industrial Engineering Faculty, K.N.Toosi University of Technology, Tehran, Iran
2Industrial Engineering Faculty, K. N. Toosi University of Technology, Tehran, Iran
چکیده
In this paper, the multi-project scheduling problem is studied. The duration of the activities is subjected to the considerable uncertainty and the robust optimization approach is considered to deal with the uncertainty. The maximum total tardiness of the projects is defined as the objective function which should be minimized. In order to allocate the constrained resources to the multi-projects, two models are proposed. In the first model, the projects are scheduled separately while in the second model, the multi-project approach is applied and the resource sharing policy is used. It is demonstrated that how the tardiness of the projects will be decreased when the multi-project approach is applied. Also, the Adaptive Bee Genetic Algorithm (ABGA) is designed as a hybrid metaheuristic algorithm and proposed in this paper to solve the first stage model of the Robust Resource Constrained Multi-Project Scheduling Problem (RRCMPSp ). The results of ABGA is compared with the results of scenario-relaxation algorithm as an exact algorithm for the small size problems. Also, the performance of ABGA is studied compared to the Genetic Algorithm (GA) and Artificial Bee Colony (ABC) as two basic algorithms for the large size problems. The results show the effectiveness of the proposed algorithm in solving the RRCMPSp .
کلیدواژه‌ها
Resource Constrained Multi-Project Scheduling Problem؛ Robust Optimization؛ Maximum Total Tardiness؛ ABGA
مراجع
آمار
تعداد مشاهده مقاله: 589
تعداد دریافت فایل اصل مقاله: 365
پیوندهای مفید
آمار
تعداد نشریات9
تعداد شماره‌ها455
تعداد مقالات5,775
تعداد مشاهده مقاله8,415,384
تعداد دریافت فایل اصل مقاله6,976,134