A hybrid heuristic algorithm for the resource-constrained project scheduling problem
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911150837334016 |
|---|---|
| author | Goncharov, Evgenii |
| author_facet | Goncharov, Evgenii |
| contents | This study presents a hybrid metaheuristic for the resource-constrained project scheduling problem (RCPSP), which integrates a genetic algorithm (GA) and a neighborhood search strategy (NS). The RCPSP consists of a set of activities that follow precedence relationship and consume resources. The resources are renewable, and the amount of the resources is limited. The objective of RCPSP is to find a schedule of the activities to minimize the project makespan. The algorithm uses two crossovers in the GA and two neighborhoods in the NS, as well as a resource ranking heuristic. The computational results with instances from the PCPLIB library validate the effectiveness of the proposed algorithm. We have obtained some of the best average deviations of the solutions from the critical path lower bound. The best heuristic solutions have been updated for some instances from PCPLIB. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_18330 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A hybrid heuristic algorithm for the resource-constrained project scheduling problem Goncharov, Evgenii Optimization and Control 05C09, 05C12, 05C92 This study presents a hybrid metaheuristic for the resource-constrained project scheduling problem (RCPSP), which integrates a genetic algorithm (GA) and a neighborhood search strategy (NS). The RCPSP consists of a set of activities that follow precedence relationship and consume resources. The resources are renewable, and the amount of the resources is limited. The objective of RCPSP is to find a schedule of the activities to minimize the project makespan. The algorithm uses two crossovers in the GA and two neighborhoods in the NS, as well as a resource ranking heuristic. The computational results with instances from the PCPLIB library validate the effectiveness of the proposed algorithm. We have obtained some of the best average deviations of the solutions from the critical path lower bound. The best heuristic solutions have been updated for some instances from PCPLIB. |
| title | A hybrid heuristic algorithm for the resource-constrained project scheduling problem |
| topic | Optimization and Control 05C09, 05C12, 05C92 |
| url | https://arxiv.org/abs/2502.18330 |