In 'Consumable resource allocation in multi-class dynamic PERT networks,' a heuristic model is proposed for consumable resources allocated in the multi-class dynamic PERT networks.
The objective is to obtain the resources allocated to the different activities by using proposed algorithm in 'Consumable resource allocation in multi-class dynamic PERT networks'.
A heuristic method for consumable resource allocation in multi-class dynamic PERT networks was considered by Yaghoubi et al. (2013).
In Figure 4, a comparative analysis of our proposed model in 'Consumable resource allocation in multi-class dynamic PERT networks,' and simulation results for this example is presented.
Denote {α c |c=1,⋯,C} as the weight coefficients of resource allocation to each priority class of sensors, where (sum _{c=1}^{C} alpha _{c}=1).
We categorized education resource allocation as 1 = key class of key school; 2 = ordinary class of key school; 3 = key class of ordinary school; 4 = ordinary class of ordinary school.
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.
Hence, the first step is actually inter-class resource allocation and the second step is the intraclass packet scheduling.
In addition, Cohen et al. (2005, 2007) by using cross entropy, based on simulation, investigated the resource allocation problem in multi-class dynamic PERT networks, where the resources can work in parallel.
We also conduct an analysis of the Traffic-to-Pilot (T2P) reverse traffic channel (RTC) MAC algorithm implemented in EV-DO Revision-A to study resource allocation for different traffic classes.
