A Dynamic Programming Formulation of Scheduling Non-Deterministic Activities with Stochastic Durations
Scheduling personal activities is a non-deterministic stochastic constraint optimization problem. Activities may have discontinuous temporal domains and arbitrary stochastic duration distributions; they may be non-deterministic, that is they succeed with some probability; they have utilities, whereas several non-trivial constraints and preferences may hold over them, etc. In this article we propose a framework based on dynamic programming to model the problem and compute optimal policies. We also propose a heuristic-based relaxation of the dynamic programming model, trying to confront the curse of dimensionality. With the relaxed approach we obtain lower bounds of the overall utility in significantly less time. An empirical analysis compares the two approaches in terms of effectiveness and efficiency.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.