RanGen: A Random Network Generator for Activity-on-the-Node Networks. 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.

References in zbMATH (referenced in 47 articles )

Showing results 1 to 20 of 47.
Sorted by year (citations)

1 2 3 next

  1. Agnetis, Alessandro; Briand, Cyril; Ngueveu, Sandra Ulrich; Šůcha, Přemysl: Price of anarchy and price of stability in multi-agent project scheduling (2020)
  2. Gerhards, Patrick: The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds (2020)
  3. Mittal, Areesh; Gokalp, Can; Hanasusanto, Grani A.: Robust quadratic programming with mixed-integer uncertainty (2020)
  4. Song, Jie; Martens, Annelies; Vanhoucke, Mario: The impact of a limited budget on the corrective action taking process (2020)
  5. Burgelman, Jeroen; Vanhoucke, Mario: Computing project makespan distributions: Markovian PERT networks revisited (2019)
  6. Creemers, Stefan: The preemptive stochastic resource-constrained project scheduling problem (2019)
  7. Hu, Xuejun; Wang, Jianjiang; Leng, Kaijun: The interaction between critical chain sequencing, buffer sizing, and reactive actions in a CC/BM framework (2019)
  8. Leyman, Pieter; van Driessche, Niels; Vanhoucke, Mario; de Causmaecker, Patrick: The impact of solution representations on heuristic net present value optimization in discrete time/cost trade-off project scheduling with multiple cash flow and payment models (2019)
  9. Rostami, Salim; Creemers, Stefan; Leus, Roel: Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (2019)
  10. Rostami, Salim; Creemers, Stefan; Wei, Wenchao; Leus, Roel: Sequential testing of (n)-out-of-(n) systems: precedence theorems and exact methods (2019)
  11. Servranckx, Tom; Vanhoucke, Mario: A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs (2019)
  12. Vanhoucke, Mario; Coelho, José: Resource-constrained project scheduling with activity splitting and setup times (2019)
  13. Briand, Cyril; Ulrich Ngueveu, Sandra; Šucha, Přemysl: Finding an optimal Nash equilibrium to the multi-agent project scheduling problem (2017)
  14. Leyman, Pieter; Vanhoucke, Mario: Capital- and resource-constrained project scheduling with net present value optimization (2017)
  15. Martens, Annelies; Vanhoucke, Mario: A buffer control method for top-down project control (2017)
  16. Wauters, Mathieu; Vanhoucke, Mario: A nearest neighbour extension to project duration forecasting with artificial intelligence (2017)
  17. Zhu, Xia; Ruiz, Rubén; Li, Shiyu; Li, Xiaoping: An effective heuristic for project scheduling with resource availability cost (2017)
  18. Davari, Morteza; Demeulemeester, Erik; Leus, Roel; Talla Nobibon, Fabrice: Exact algorithms for single-machine scheduling with time windows and precedence constraints (2016)
  19. Li, Hongbo; Demeulemeester, Erik: A genetic algorithm for the robust resource leveling problem (2016)
  20. Li, Hongbo; Xu, Zhe; Xiong, Li; Liu, Yinbin: Robust proactive project scheduling model for the stochastic discrete time/cost trade-off problem (2015)

1 2 3 next