An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case
Roubila Lilia Kadri and
Fayez F. Boctor
European Journal of Operational Research, 2018, vol. 265, issue 2, 454-462
In this article, we address the resource-constrained project scheduling problem with transfer times (RCPSPTT). We assume that pre-emption is not allowed, and precedence relations are zero-lag finish-to-start relations. We also assume that the durations and resource transfer times of activities are known and deterministic. The objective is to choose a start time for each activity of the project so that the project duration is minimized, while satisfying precedence relations, resource availabilities, and resource-transfer time constraints. We propose a new genetic algorithm using a two-point crossover operator. The experiment, conducted on a large number of instances, shows that the proposed algorithm performs better than several solution methods previously published.
Keywords: Project scheduling; Resource transfer time; Genetic algorithms (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:265:y:2018:i:2:p:454-462
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().