Multi-objective time–cost trade-off in dynamic PERT networks using an interactive approach

Azaron, Amir; Tavakkoli–Moghaddam, Reza

doi:10.1016/j.ejor.2006.05.014

Cited by 41 publications

(25 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, we transform the differential equations into difference equations. Thus, the corresponding discrete state model can be given as follows (for more details see Azaron and Tavakkoli-Moghaddam, 2007):…”

Section: (øø)mentioning

confidence: 99%

“…Example 1. Consider the stochastic network shown in Figure 1 taken from Azaron and Tavakkoli-Moghaddam (2007). According to the definition, the UDCs of this network are (1,2); (2,3); (1,4,6); (3,4,6); and (5,6).…”

Section: Project Completion Time Distributionmentioning

confidence: 99%

“…As the main contribution of this paper, we present a heuristic method for the consumable resource allocation problem (or time-cost trade-off problem) in multi-class dynamic PERT networks. Note that the resource allocation problem in multi-class dynamic PERT networks is a generalization of the resource allocation problem in dynamic PERT network, investigated by Azaron and Tavakkoli-Moghaddam (2007) by considering only one type (class) of projects in multiproject system.…”

Section: Introductionmentioning

confidence: 99%

“…On the other hand, Azaron and Tavakkoli-Moghaddam (2007) proposed an analytical multi-objective model to optimally control consumable resources allocated to the activities in a dynamic PERT network, where only one type of project exists in the system and the number of servers in every service station is either 1 or infinity. They assumed that the activity durations are exponentially distributed random variables, resources allocated affect the mean of service times, and the new projects are generated according to a Poisson process.…”

Section: Introductionmentioning

confidence: 99%

“…For modeling of a single-class dynamic PERT network, we use Markov process and a multi-objective model, investigated by Azaron and Tavakkoli-Moghaddam (2007), namely, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state absorbing continuous-time Markov model, a system of differential equations is created.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

2013

View full text Add to dashboard Cite

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a node of the network with exponential distribution according to its class. Indeed, each project arrives to the first service station and continues its routing according to precedence network of its class. Such system can be represented as a queuing network, while the discipline of queues is first come, first served. On the basis of presented method, a multi-class system is decomposed into several single-class dynamic PERT networks, whereas each class is considered separately as a minisystem. In modeling of single-class dynamic PERT network, we use Markov process and a multi-objective model investigated by Azaron and Tavakkoli-Moghaddam in 2007. Then, after obtaining the resources allocated to service stations in every minisystem, the final resources allocated to activities are calculated by the proposed method.

show abstract

Section: (øø)mentioning

confidence: 99%

Section: Project Completion Time Distributionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations