Optimal reduction of two-terminal directed acyclic graphs
SIAM Journal on Computing
A random activity network generator
Operations Research
Resource-constrained project scheduling: a survey of recent developments
Computers and Operations Research
A classification of predictive-reactive project scheduling procedures
Journal of Scheduling
Computers and Industrial Engineering
Setup times and fast tracking in resource-constrained project scheduling
Computers and Industrial Engineering
Parallel machine scheduling with precedence constraints and setup times
Computers and Operations Research
Criticality analysis of activity networks under interval uncertainty
Journal of Scheduling
Computers and Industrial Engineering
Scheduling an r&d project with quality-dependent time slots
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Scheduling Markovian PERT networks to maximize the net present value
Operations Research Letters
An exact method for scheduling of the alternative technologies in R&D projects
Computers and Operations Research
Sequential testing policies for complex systems under precedence constraints
Expert Systems with Applications: An International Journal
Fast minimum float computation in activity networks under interval uncertainty
Journal of Scheduling
Expert Systems with Applications: An International Journal
Computers and Industrial Engineering
Scheduling modular projects on a bottleneck resource
Journal of Scheduling
Hi-index | 0.00 |
In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.