An evaluation of the adequacy of project network generators with systematically sampled networks

被引:148
作者
Vanhoucke, Mario [1 ,2 ]
Coelho, Jose [3 ,4 ]
Debels, Dieter [1 ]
Maenhout, Broos [1 ]
Tavares, Luis V. [3 ]
机构
[1] Univ Ghent, Fac Econ & Business Adm, Dept Management Informat Operat Management & Tech, B-9000 Ghent, Belgium
[2] Operat & Technol Management Ctr, Vlerick Leuven Gent Management Sch, B-9000 Ghent, Belgium
[3] Tech Univ, Inst Super Tecn, CESUR, P-1049001 Lisbon, Portugal
[4] Univ Alberta, DCET, P-1269001 Lisbon, Portugal
关键词
project scheduling; networks; topological structure;
D O I
10.1016/j.ejor.2007.03.032
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper evaluates and compares different network generators to generate project scheduling problem instances based on indicators measuring the topological network structure. We review six topological network indicators in order to describe the detailed structure of a project network. These indicators were originally developed by [L.V. Tavares, J.A. Ferreira and J.S. Coelho, The risk of delay of a project in terms of the morphology of its network, European Journal of Operational Research 119 (1999), 510-537] and have been modified, or sometimes completely replaced, by alternative indicators to describe the network topology. The contribution of this paper is twofold. Firstly, we generate a large amount of different networks with four project network generators. Our general conclusions are that none of the network generators are able to capture the complete feasible domain of all networks. Additionally, each network generator covers its own network-specific domain and, consequently, contributes to the generation of data sets. Secondly, we perform computational results on the well-known resource-constrained project scheduling problem to prove that our indicators are reliable and have significant, predictive power to serve as complexity indicators. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:511 / 524
页数:14
相关论文
共 23 条
[1]  
[Anonymous], REV FRANCAISE RECHER
[2]   OPTIMAL REDUCTION OF 2-TERMINAL DIRECTED ACYCLIC GRAPHS [J].
BEIN, WW ;
KAMBUROWSKI, J ;
STALLMANN, MFM .
SIAM JOURNAL ON COMPUTING, 1992, 21 (06) :1112-1129
[3]  
Dar-EL E. M., 1973, AIIE Transactions, V5, P343, DOI 10.1080/05695557308974922
[4]   EXPERIMENTAL INVESTIGATION OF RESOURCE ALLOCATION IN MULTIACTIVITY PROJECTS [J].
DAVIES, EM .
OPERATIONAL RESEARCH QUARTERLY, 1973, 24 (04) :587-591
[5]  
Davis E. W., 1975, AIIE Transactions, V7, P132, DOI 10.1080/05695557508974995
[6]   A RANDOM ACTIVITY NETWORK GENERATOR [J].
DEMEULEMEESTER, E ;
DODIN, B ;
HERROELEN, W .
OPERATIONS RESEARCH, 1993, 41 (05) :972-980
[7]   RanGen: A random network generator for activity-on-the-node networks [J].
Demeulemeester, E ;
Vanhoucke, M ;
Herroelen, W .
JOURNAL OF SCHEDULING, 2003, 6 (01) :17-38
[8]   New benchmark results for the resource - Constrained project scheduling problem [J].
Demeulemeester, EL ;
Herroelen, WS .
MANAGEMENT SCIENCE, 1997, 43 (11) :1485-1492
[9]  
Elmaghraby S.E., 1977, Activity Networks: Project Planning and Control by Network Models
[10]   ON THE MEASUREMENT OF COMPLEXITY IN ACTIVITY NETWORKS [J].
ELMAGHRABY, SE ;
HERROELEN, WS .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (04) :223-234