Comparing Schedule Generation Schemes in Resource-Constrained Project Scheduling Using Elitist Genetic Algorithm

Abstract

An issue has arisen with regard to which of the schedule generation schemes will perform better for an arbitrary instance of the resource-constrained project scheduling problem (RCPSP), which is one of the most challenging areas in construction engineering and management. No general answer has been given to this issue due to the different mechanisms between the serial scheme and the parallel scheme. In an effort to address this issue, this paper compares the two schemes using a permutation-based Elitist genetic algorithm for the RCPSP. Computational experiments are presented with multiple standard problems. From the results of a paired difference experiment, the algorithm using the serial scheme provides better solutions than the one using the parallel scheme. The results also show that the algorithm with the parallel scheme takes longer to solve each problem than the one using the serial scheme.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 32 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.