2013
DOI: 10.19030/jber.v11i11.8193
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Mode Resource-Constrained Project-Scheduling Problem With Renewable Resources: New Solution Approaches

Abstract: We consider the multi-mode resource-constrained project scheduling problem (MRCPSP)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
11
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 28 publications
0
11
0
Order By: Relevance
“…Satisfiablity Testing (SAT) [10], non-greedy heuristics [11], and automatic algorithm selection [31] are among effective methods applied to the MRCPSP, and MRCPSP/R. Classified as other methods, these three algorithms are briefly discussed here.…”
Section: Hybridsmentioning
confidence: 99%
See 1 more Smart Citation
“…Satisfiablity Testing (SAT) [10], non-greedy heuristics [11], and automatic algorithm selection [31] are among effective methods applied to the MRCPSP, and MRCPSP/R. Classified as other methods, these three algorithms are briefly discussed here.…”
Section: Hybridsmentioning
confidence: 99%
“…Two non-greedy heuristics applied to MRCPSP-R [11] are based on the fact that eliminating unnecessary vacant spaces in the Gant Chart and backward-forward method have proved to be very effective for the RCPSP. In the employed non-greedy modes, an eligible activity which can be executed in a comparatively time-consuming mode, can be put in a waiting status so that a faster mode to become available.…”
Section: Hybridsmentioning
confidence: 99%
“…Obtained results prove that such methods stand interesting feature that can be included to more complex methods and increase their robustness. Colak et al [36] consider the multi-mode resource-constrained project scheduling problem (MRCPSP) with renewable resources. In MRCPSP, an activity can be executed in one of many possible modes; each mode having different resource requirements and accordingly different activity durations.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Here, equation (13) is the total quantity of every technology resource, A t is the executing task set during ½t À 1, t; equation (14) is the technology resource requirement constraint, r k i max = R k ; equation (15) shows that one task was only executed by one person; equation (16) shows that at the same time, one person can only do one task; and equation (17) is the time sequence constraint of task, B(s) is the preceding task set of task T s .…”
Section: Problem Descriptionmentioning
confidence: 99%