A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem
| Autor: | Albert Einstein Fernandes Muritiba, Francíio Araùjo da Costa, Carlos Diego Rodrigues |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
021103 operations research
General Computer Science Job shop scheduling Computer science business.industry 0211 other engineering and technologies Mode (statistics) 02 engineering and technology Management Science and Operations Research Set (abstract data type) Project scheduling problem Modeling and Simulation Path (graph theory) 0202 electrical engineering electronic engineering information engineering Benchmark (computing) 020201 artificial intelligence & image processing Local search (optimization) business Algorithm Non-renewable resource |
| Zdroj: | Computers & Operations Research. 92:145-154 |
| ISSN: | 0305-0548 |
| DOI: | 10.1016/j.cor.2018.01.001 |
| Popis: | This paper proposes a Path-Relinking (PR) algorithm for the well-known and NP-hard Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). This problem generalizes the Resource-Constrained Project Scheduling Problem (RCPSP) where the project activities have a set of execution modes. For each execution mode, the processing time, the renewable and nonrenewable resource demands are given. The MRCPSP goal is to minimize the total makespan of the project. The PR algorithm works by travelling through the solution space between two solutions, it performs local search around the intermediate solutions. This work also presents computational tests using benchmark instances to compare our implementation with the most competitive methods from the literature. The PR’s computational results improve the earlier results reported for the benchmark instance sets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect