Hitting the memory wall: implications of the obvious
ACM SIGARCH Computer Architecture News
Resource-constrained project scheduling: a survey of recent developments
Computers and Operations Research
Rollout Algorithms for Combinatorial Optimization
Journal of Heuristics
Rollout Algorithms for Stochastic Scheduling Problems
Journal of Heuristics
Solving Project Scheduling Problems by Minimum Cut Computations
Management Science
Computers and Operations Research
The electromagnetism meta-heuristic applied to the resource-constrained project scheduling problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A genetic algorithm approach to a general category projectscheduling problem
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource constraints are satisfied while achieving some objective. Priority rule-based heuristics are widely used for large problems and more recently justification has been shown to be an important extension. Xu et al. further augments priority rule heuristics by creating rollout procedures and proves their effectiveness. However, that procedure generates just one schedule. We extend that method using sampling to generate a set of schedules using probabilistic techniques and select the best schedule from this sample. Using the 600 problem instances in PSLIB, we present empirical evidence that this procedure produces solutions that are better than the rollout procedure alone but at a computational cost.