2013
DOI: 10.1016/j.cie.2013.06.017
|View full text |Cite
|
Sign up to set email alerts
|

Resource constrained project scheduling problem with discounted earliness–tardiness penalties: Mathematical modeling and solving procedure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
19
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(19 citation statements)
references
References 27 publications
0
19
0
Order By: Relevance
“…Leyman and Vanhoucke (2015) and Leyman and Vanhoucke (2016) used the payments at activities completion times model to maximize the NVP, where it was assumed that cash inflows and outflows for each activity occur at its completion time. Presenting their model, Khoshjahan et al (2013) tried to minimize the present value of earliness-tardiness penalty costs through defining a deadline for each activity. In their research, the mathematical programming model was proposed first, followed by the application of two solution algorithms (i.e., genetics and simulated annealing) to solve this NP-Hard problem.…”
Section: Net Present Value (Npv)mentioning
confidence: 99%
“…Leyman and Vanhoucke (2015) and Leyman and Vanhoucke (2016) used the payments at activities completion times model to maximize the NVP, where it was assumed that cash inflows and outflows for each activity occur at its completion time. Presenting their model, Khoshjahan et al (2013) tried to minimize the present value of earliness-tardiness penalty costs through defining a deadline for each activity. In their research, the mathematical programming model was proposed first, followed by the application of two solution algorithms (i.e., genetics and simulated annealing) to solve this NP-Hard problem.…”
Section: Net Present Value (Npv)mentioning
confidence: 99%
“…First research papers covering NPV optimisation did not take into consideration project resource constraints [4][5]. Currently, the research focuses on the RCPSP-DC problem [6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. For a review of models and algorithms including cash flow optimisation, we refer the reader to [1][2][3]21].…”
Section: Introductionmentioning
confidence: 99%
“…There are defined exact execution deadlines or time windows in which the execution of an activity or milestone is neither rewarded, nor penalised. A problem is analysed [7], where for each activity a deadline for its execution is defined in order to minimise the NPV of expense on activity execution before or after the required deadline (earliness-tardiness penalties). Various contractor-client settlement systems with progress-of-execution-related penalties and bonuses are considered [8][9][10][11][27][28].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Many other models are proposed to present the relationship between resources allocation and schedule optimization, which try to find the most optimal approach for solving the resource-constrained project scheduling problem [9]- [11]. The resource-constrained project scheduling problem (RCPSP) with a fixed date for every activity has the objective to complete the task in quality within the established deadline [12]. In the resource-constrained project scheduling problem, it is required to restart a fixed setup time while an activity is began, all of activities are interrelated by finish to start type precedence relations with the time lag of the minimum [13].…”
Section: Introductionmentioning
confidence: 99%