Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms
Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. However, increasing dimensions of a project, whether in number of activities or resource availability, cause unused resources through the planning horizon. Such phenomena may increase ma...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2015
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/45488/ http://psasir.upm.edu.my/id/eprint/45488/1/GENETIC.pdf |
| _version_ | 1848850509328285696 |
|---|---|
| author | Mohd Ariffin, Mohd Khairol Anuar Baharudin, B. T. Hang Tuah Leman, Zulkiflle Delgoshaei, Aidin |
| author_facet | Mohd Ariffin, Mohd Khairol Anuar Baharudin, B. T. Hang Tuah Leman, Zulkiflle Delgoshaei, Aidin |
| author_sort | Mohd Ariffin, Mohd Khairol Anuar |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. However, increasing dimensions of a project, whether in number of activities or resource availability, cause unused resources through the planning horizon. Such phenomena may increase makespan of a project and also decline resource-usage efficiency. To solve this problem, many methods have been proposed before. In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). The proposed method is explained using some related examples from literature and the results are then compared with a forward serial programming method. In addition, the performance of the proposed method is measured using a mathematical metric. Our findings show that the proposed approach can provide schedules with good quality for both small and large scale problems. |
| first_indexed | 2025-11-15T10:07:25Z |
| format | Article |
| id | upm-45488 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:07:25Z |
| publishDate | 2015 |
| publisher | Growing Science |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-454882021-01-23T22:26:41Z http://psasir.upm.edu.my/id/eprint/45488/ Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms Mohd Ariffin, Mohd Khairol Anuar Baharudin, B. T. Hang Tuah Leman, Zulkiflle Delgoshaei, Aidin Resource-Constrained Project Scheduling Problem (RCPSP) is considered as an important project scheduling problem. However, increasing dimensions of a project, whether in number of activities or resource availability, cause unused resources through the planning horizon. Such phenomena may increase makespan of a project and also decline resource-usage efficiency. To solve this problem, many methods have been proposed before. In this article, an effective backward-forward search method (BFSM) is proposed using Greedy algorithm that is employed as a part of a hybrid with a two-stage genetic algorithm (BFSM-GA). The proposed method is explained using some related examples from literature and the results are then compared with a forward serial programming method. In addition, the performance of the proposed method is measured using a mathematical metric. Our findings show that the proposed approach can provide schedules with good quality for both small and large scale problems. Growing Science 2015 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/45488/1/GENETIC.pdf Mohd Ariffin, Mohd Khairol Anuar and Baharudin, B. T. Hang Tuah and Leman, Zulkiflle and Delgoshaei, Aidin (2015) Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms. International Journal of Industrial Engineering Computations, 6 (4). pp. 503-520. ISSN 1923-2934; ESSN: 1923-2926 http://growingscience.com/beta/ijiec/2016-minimizing-makespan-of-a-resource-constrained-scheduling-problem-a-hybrid-greedy-and-genetic-algorithms.html 10.5267/j.ijiec.2015.5.002 |
| spellingShingle | Mohd Ariffin, Mohd Khairol Anuar Baharudin, B. T. Hang Tuah Leman, Zulkiflle Delgoshaei, Aidin Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title | Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title_full | Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title_fullStr | Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title_full_unstemmed | Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title_short | Minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| title_sort | minimizing makespan of a resource-constrained scheduling problem: a hybrid greedy and genetic algorithms |
| url | http://psasir.upm.edu.my/id/eprint/45488/ http://psasir.upm.edu.my/id/eprint/45488/ http://psasir.upm.edu.my/id/eprint/45488/ http://psasir.upm.edu.my/id/eprint/45488/1/GENETIC.pdf |