2010
DOI: 10.1016/j.ejor.2009.11.005
|View full text |Cite
|
Sign up to set email alerts
|

A survey of variants and extensions of the resource-constrained project scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
376
0
4

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 745 publications
(380 citation statements)
references
References 191 publications
(290 reference statements)
0
376
0
4
Order By: Relevance
“…This is the main reason why researchers try to build methods that give feasible (sub)optimal solution in a time that is acceptable for a user. An agreement is reached in soft computing, where mostly heuristics and metaheuristics (Hartmann and Briskorn 2010;Kolisch and Sprecher 1996) are used.…”
Section: Introductionmentioning
confidence: 99%
“…This is the main reason why researchers try to build methods that give feasible (sub)optimal solution in a time that is acceptable for a user. An agreement is reached in soft computing, where mostly heuristics and metaheuristics (Hartmann and Briskorn 2010;Kolisch and Sprecher 1996) are used.…”
Section: Introductionmentioning
confidence: 99%
“…The contractor either receives a bonus for early activity (milestone) completion, or is charged with a penalty for a delay. A review of project scheduling research taking into account economic criteria and cash flows can be found in analytical papers (Hartmann & Briskorn, 2012;Herroelen et al, 1997;Kolisch & Padman, 2001;Węglarz, 1999). Those papers also address other issues which are not discussed here.…”
Section: Introductionmentioning
confidence: 99%
“…Russell (1970) was the first to develop a model (the Max-NPV model) in which the discounted cash flows generated during project execution were optimised. NPV is the most common economic assessment criterion for project scheduling (Hartmann & Briskorn, 2012).…”
Section: Introductionmentioning
confidence: 99%
“…[3][12] [8]) as extension of RCPSP [4]. It is NP-hard [2] and there is no effective algorithm to solve it.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, several types of (meta)heuristic methods can be effectively applied. There can be found applications of (MS-)RCPSP in literature based on: heuristics [3] [12], tabu search [11], evolutionary algorithms (EA) with specialized operators [10], (hybridized) ant colony optimization [9], teaching-learningbased optimization algorithm [13], differential evolution [14], hybridized differential evolution [6] and many others.…”
Section: Introductionmentioning
confidence: 99%