A Random Activity Network Generator

A Random Activity Network Generator

Exact and heuristic procedures are often developed to obtain optimal and near-optimal solutions to decision problems modeled as activity networks. Testing the accuracy and efficiency of these procedures requires the use of activity networks with various sizes, structures, and parameters. The size of...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Operations Research. - Institute for Operations Research and the Management Sciences, 1956. - 41(1993), 5, Seite 972-980
1. Verfasser: Demeulemeester, E. (VerfasserIn)
Weitere Verfasser: Dodin, B., Herroelen, W.
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 1993
Zugriff auf das übergeordnete Werk:Operations Research
Schlagworte:Networks/graphs: stochastic theory Project management: PERT, resource constraints Computing Mathematics Business Behavioral sciences Applied sciences Information science Education
LEADER 01000caa a22002652 4500
001 JST063686147
003 DE-627
005 20240622102401.0
007 cr uuu---uuuuu
008 150325s1993 xx |||||o 00| ||eng c
035 |a (DE-627)JST063686147 
035 |a (JST)171659 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Demeulemeester, E.  |e verfasserin  |4 aut 
245 1 2 |a A Random Activity Network Generator 
264 1 |c 1993 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
520 |a Exact and heuristic procedures are often developed to obtain optimal and near-optimal solutions to decision problems modeled as activity networks. Testing the accuracy and efficiency of these procedures requires the use of activity networks with various sizes, structures, and parameters. The size of the network is determined by its number of nodes and arcs, where the structure is chosen from the set of all structures for the specified network size. The network parameters depend on the nature of the decision problem. Often, it is desirable for test problems to be generated at random from the space of all feasible networks. This paper deals with the problem of generating the size and structure of the network at random from the space of all feasible networks. It develops a theory which guarantees the randomness of the network structure. The theory is the basis for two methods. One can be used to generate dense networks, where the other is used to generate nondense networks. The methods, which are practical and easy to use, have been programmed for use on mainframe or personal computers. CPU time requirements are negligible. Copies of the computer program can be obtained from the authors. 
540 |a Copyright 1993 The Operations Research Society of America 
650 4 |a Networks/graphs: stochastic theory 
650 4 |a Project management: PERT, resource constraints 
650 4 |a Computing 
650 4 |a Mathematics  |x Pure mathematics  |x Discrete mathematics  |x Graph theory  |x Adjacency matrix 
650 4 |a Mathematics  |x Applied mathematics  |x Statistics  |x Applied statistics  |x Descriptive statistics  |x Statistical sampling  |x Random allocation 
650 4 |a Business  |x Business economics  |x Commercial production  |x Production resources  |x Resource management  |x Time management  |x Scheduling 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Problem solving  |x Heuristics 
650 4 |a Applied sciences  |x Computer science  |x Algorithms 
650 4 |a Information science  |x Information analysis  |x Data analysis  |x Regression analysis  |x Multilevel models 
650 4 |a Applied sciences  |x Engineering  |x Transportation 
650 4 |a Education  |x Formal education  |x Educational institutions  |x Schools  |x Private schools  |x Parochial schools  |x Catholic schools 
650 4 |a Behavioral sciences  |x Psychology  |x Cognitive psychology  |x Cognitive processes  |x Decision making 
650 4 |a Business  |x Business administration  |x Business management  |x Project management 
655 4 |a research-article 
700 1 |a Dodin, B.  |e verfasserin  |4 aut 
700 1 |a Herroelen, W.  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t Operations Research  |d Institute for Operations Research and the Management Sciences, 1956  |g 41(1993), 5, Seite 972-980  |w (DE-627)320595005  |w (DE-600)2019440-7  |x 15265463  |7 nnns 
773 1 8 |g volume:41  |g year:1993  |g number:5  |g pages:972-980 
856 4 0 |u https://www.jstor.org/stable/171659  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_JST 
912 |a GBV_ILN_11 
912 |a GBV_ILN_20 
912 |a GBV_ILN_22 
912 |a GBV_ILN_23 
912 |a GBV_ILN_24 
912 |a GBV_ILN_31 
912 |a GBV_ILN_32 
912 |a GBV_ILN_39 
912 |a GBV_ILN_40 
912 |a GBV_ILN_60 
912 |a GBV_ILN_62 
912 |a GBV_ILN_63 
912 |a GBV_ILN_65 
912 |a GBV_ILN_69 
912 |a GBV_ILN_70 
912 |a GBV_ILN_90 
912 |a GBV_ILN_95 
912 |a GBV_ILN_100 
912 |a GBV_ILN_101 
912 |a GBV_ILN_110 
912 |a GBV_ILN_120 
912 |a GBV_ILN_152 
912 |a GBV_ILN_187 
912 |a GBV_ILN_224 
912 |a GBV_ILN_285 
912 |a GBV_ILN_374 
912 |a GBV_ILN_702 
912 |a GBV_ILN_2001 
912 |a GBV_ILN_2003 
912 |a GBV_ILN_2005 
912 |a GBV_ILN_2006 
912 |a GBV_ILN_2007 
912 |a GBV_ILN_2008 
912 |a GBV_ILN_2009 
912 |a GBV_ILN_2010 
912 |a GBV_ILN_2011 
912 |a GBV_ILN_2014 
912 |a GBV_ILN_2015 
912 |a GBV_ILN_2018 
912 |a GBV_ILN_2020 
912 |a GBV_ILN_2021 
912 |a GBV_ILN_2026 
912 |a GBV_ILN_2027 
912 |a GBV_ILN_2034 
912 |a GBV_ILN_2044 
912 |a GBV_ILN_2048 
912 |a GBV_ILN_2050 
912 |a GBV_ILN_2055 
912 |a GBV_ILN_2056 
912 |a GBV_ILN_2057 
912 |a GBV_ILN_2059 
912 |a GBV_ILN_2061 
912 |a GBV_ILN_2065 
912 |a GBV_ILN_2068 
912 |a GBV_ILN_2106 
912 |a GBV_ILN_2107 
912 |a GBV_ILN_2108 
912 |a GBV_ILN_2111 
912 |a GBV_ILN_2112 
912 |a GBV_ILN_2113 
912 |a GBV_ILN_2118 
912 |a GBV_ILN_2122 
912 |a GBV_ILN_2129 
912 |a GBV_ILN_2143 
912 |a GBV_ILN_2147 
912 |a GBV_ILN_2148 
912 |a GBV_ILN_2152 
912 |a GBV_ILN_2153 
912 |a GBV_ILN_2190 
912 |a GBV_ILN_2232 
912 |a GBV_ILN_2472 
912 |a GBV_ILN_2935 
912 |a GBV_ILN_2940 
912 |a GBV_ILN_2949 
912 |a GBV_ILN_2950 
912 |a GBV_ILN_4012 
912 |a GBV_ILN_4035 
912 |a GBV_ILN_4037 
912 |a GBV_ILN_4046 
912 |a GBV_ILN_4112 
912 |a GBV_ILN_4125 
912 |a GBV_ILN_4126 
912 |a GBV_ILN_4242 
912 |a GBV_ILN_4246 
912 |a GBV_ILN_4249 
912 |a GBV_ILN_4251 
912 |a GBV_ILN_4305 
912 |a GBV_ILN_4306 
912 |a GBV_ILN_4307 
912 |a GBV_ILN_4313 
912 |a GBV_ILN_4322 
912 |a GBV_ILN_4323 
912 |a GBV_ILN_4324 
912 |a GBV_ILN_4325 
912 |a GBV_ILN_4326 
912 |a GBV_ILN_4335 
912 |a GBV_ILN_4338 
912 |a GBV_ILN_4346 
912 |a GBV_ILN_4393 
912 |a GBV_ILN_4700 
951 |a AR 
952 |d 41  |j 1993  |e 5  |h 972-980