ISSN 2353-6977 (Online)
The paper aims to present an application of constraint programming techniques for project portfolio scheduling taking into account the imprecision in activity duration and cost. Data specification in the form of discrete a-cuts allows combining distinct and imprecise data, and implementing a constraint satisfaction problem with the use of constraint programming. Moreover using a-cuts, optimistic, pessimistic, and several intermediate scenarios concerning the project scheduling and cash flows can be obtained and considered in terms of different risk levels.
| Next > |
|---|
