2019
DOI: 10.5267/j.jpm.2019.3.005
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm for scheduling multimode resource-constrained project problem in the presence of preemptive resources

Abstract: In this paper, a backward approach is proposed for maximizing net present value (NPV) in multi-mode resource constrained project scheduling problem while assuming discounted positive cash flows (MRCPSP-DCF). The progress payment method is used and all resources are considered as pre-emptible. The proposed approach maximizes NPV using unscheduled resources through resource calendar in backward mode. For this purpose, a Genetic Algorithm is applied to solve experimental cases with 50 variables and the results ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 33 publications
(35 reference statements)
0
6
0
Order By: Relevance
“…They proposed a new genetic algorithm using a two-point crossover operator. Delgoshaei et al (2019) developed a multi-objective nonlinear mixed integer programming model where resource availability was not deterministic and expressed by triangular probability function. In addition, a multi-objective weighting genetic algorithm was proposed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…They proposed a new genetic algorithm using a two-point crossover operator. Delgoshaei et al (2019) developed a multi-objective nonlinear mixed integer programming model where resource availability was not deterministic and expressed by triangular probability function. In addition, a multi-objective weighting genetic algorithm was proposed.…”
Section: Literature Reviewmentioning
confidence: 99%
“…T S and C S are the dimensionless index values of the total project construction period and total cost of individual projects, respectively. For dimensionless treatment, see formulas (11) and (12).…”
Section: Fitness Functionmentioning
confidence: 99%
“…Literature [10] transformed RIP into an RCPSP problem, which was solved by the metaheuristic algorithm based on Scatter Search. Literature [11] uses a genetic algorithm to solve the resource input problem with delay penalty and codes the job priority and resource capacity respectively. Literature [12] solved the RIP problem by path reconnection and genetic algorithm for the first time without transforming the RIP problem into RCPSP.…”
Section: Introductionmentioning
confidence: 99%
“…e PRCPSP (Preemptive Resource-Constrained Project Scheduling Problem) mathematical model aiming at the shortest maintenance time and the minimum total load of maintenance personnel is established in references [6][7][8]. Literature [9] introduces GPRs (Generalized priority relation) and AON (Activity-On-Node) to describe the sequential relationship of tasks and uses an improved cuckoo algorithm to solve the problem.…”
Section: Introductionmentioning
confidence: 99%