Effective genetic algorithm for resource-constrained project scheduling with limited preemptions

From National Research Council Canada

DOIResolve DOI: https://doi.org/10.1007/s13042-011-0014-3
AuthorSearch for: ; Search for: ; Search for: 1
Affiliation
  1. National Research Council of Canada. NRC Institute for Research in Construction
FormatText, Article
Subject0-1 knapsack problem; Activity list; Competitive algorithms; Computational experiment; Makespan; Makespan minimization; Pre-emption; Pseudo-polynomial time complexity; Resource allocation problem; Resource availability; Resource constrained project scheduling; Resource-constrained project scheduling problem; Dynamic programming; Integer programming; Polynomial approximation; Resource allocation; Scheduling algorithms; Genetic algorithms
Abstract
Publication date
In
LanguageEnglish
Peer reviewedYes
NPARC number21271447
Export citationExport as RIS
Report a correctionReport a correction (opens in a new tab)
Record identifier7fec4d6f-f1b1-4a22-8725-88884f1cbf59
Record created2014-03-24
Record modified2020-04-21
Date modified: