GRAN and its application

Author

Sijun, Bai ; Guangming, Cao ; Yasheng, Gu ; Fupei, Qian

Author_Institution

Inst. of Manage., Northwestern Polytech. Univ., Shannxi, China

fYear

1991

fDate

16-17 Jun 1991

Firstpage

706

Abstract

Computational experiments conducted in the field of activity network planning techniques are usually based on the use of the generator of random activity network (GRAN) to generate a set of random activity networks for the purpose of algorithm validation. After discussing the basic characteristics to be possessed by a GRAN, this paper gives: first, an analysis for the existing problems in developing GRAN; secondly, several useful conclusions of designing GRAN; thirdly, specific algorithms of designing GRAN with a given number of nodes and arcs; and last, an analysis for the effectiveness of heuristic criteria in networks scheduling with limited resources. Two regression equations are derived to estimate the duration of networks characterized by one and three resources respectively using the minimum slack time criterion

Keywords

computational complexity; directed graphs; resource allocation; scheduling; GRAN; activity network planning techniques; algorithm validation; arcs; duration; heuristic criteria; minimum slack time criterion; networks scheduling; nodes; random activity networks; regression equations; Algorithm design and analysis; Area measurement; Character generation; Circuits; Computational efficiency; Equations; Extraterrestrial measurements; Independent component analysis; Joining processes; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1991. Conference Proceedings, China., 1991 International Conference on

Conference_Location

Shenzhen

Type

conf

DOI

10.1109/CICCAS.1991.184456

Filename

184456