Search for: pert-networks
0.007 seconds

    Optimal constrained non-renewable resource allocation in PERT networks with discrete activity times

    , Article Scientia Iranica ; Volume 19, Issue 3 , 2012 , Pages 841-848 ; 10263098 (ISSN) Hashemin, S. S ; Fatemi Ghomi, S. M. T ; Modarres, M ; Sharif University of Technology
    In this paper, we develop an approach to optimally allocate a limited nonrenewable resource among the activities of a project, represented by a PERT-Type Network (PTN). The project needs to be completed within some specified due date. The objective is to maximize the probability of project completion on time. The duration of each activity is an arbitrary discrete random variable and also depends on the amount of consumable resource allocated to it. On the basis of the structure of networks, they are categorized as either reducible or irreducible. For each network structure, an analytical algorithm is presented. Through some examples, the algorithms are illustrated  

    Due date assignment in repetitive projects

    , Article International Journal of Production Economics ; Volume 129, Issue 1 , January , 2011 , Pages 79-85 ; 09255273 (ISSN) Azaron, A ; Fynes, B ; Modarres, M ; Sharif University of Technology
    This paper is concerned with the study of the constant due-date assignment policy in repetitive projects, where the activity durations are exponentially distributed random variables. It is then extended to the case where activity durations follow generalized Erlang distributions. The main feature of this research over the classical PERT networks is that the projects are generated according to a renewal process and share the same facilities. Our approach is first to obtain the project completion time distribution, for each generated project, by constructing a proper continuous-time Markov chain, and then to compute the optimal constant lead time for each particular project. The repetitive...