Location of Repository

An investigation of resource-allocation decisions by means of project networks.

By Roel Leus


This paper investigates the relationship between resource allocation and ES-policies, which are a type of scheduling policies introduced for stochastic scheduling and which can be represented by a directed acyclic graph. We present a formal treatment of resource flows as are presentation of resource-allocation decisions, extending the existing literature. A number of complexity results are established, showing that a number of recently proposed objective functions for evaluating the quality of ES-policies lead to difficult problems. Finally, some reflections are provided on possible effciency enhancements to enumeration algorithms for ES-policies.Complexity; Project scheduling; Resource allocation; Resource constraints;

OAI identifier:

Suggested articles



  1. (2005). A bi-objective model for robust resource-constrained project scheduling.
  2. (1977). A management guide to PERT/CPM: with GERT/PDM/CPM and other networks.
  3. (1983). Algorithmic approaches to preselective strategies for stochastic scheduling problems.
  4. (2003). An e±cient proactive reactive scheduling approach to hedge against shop °oor disturbances. In
  5. (1988). Computational complexity of PERT problems.
  6. (1979). Computers and intractability. A guide to the theory of NP-completeness.
  7. (1993). Graph augmentation and related problems: theory and practice.
  8. (1964). Les problµ emes d'ordonnancement avec contraintes disjonctives.
  9. (1988). Maintenance of transitive closures and transitive reductions of graphs.
  10. (1984). Network design and transportation planning: models and algorithms.
  11. (1993). Network Flows: Theory, Algorithms, and Applications.
  12. (1989). Network synthesis and optimum network design problems: models, solution methods and applications. Networks,
  13. (1985). ohring. Algorithmic aspects of comparability graphs and interval graphs.
  14. (2001). ohring. Scheduling under uncertainty: bounding the makespan distribution.
  15. (2005). On budget-constrained °ow improvement.
  16. (2005). On network design: ¯xed charge °ows and the covering steiner problem.
  17. (2005). On the generation of circuits and minimal forbidden sets.
  18. (1983). Preselective strategies for the optimization of stochastic project networks under resource constraints.
  19. (2005). Proactive resource allocation heuristics for robust project scheduling.
  20. (2002). Project Scheduling. A Research Handbook.
  21. (1989). Resource allocation in a network model - the Leinet system.
  22. (2005). Resource allocation in project management.
  23. (1988). Scheduling project networks with resource constraints and time windows.
  24. (2005). Scheduling with uncertainty { a proactive approach using partial order schedules. PhD thesis, Universitµ a degli Studi di Roma \La Sapienza",
  25. (2004). Stability and resource allocation in project planning.
  26. (2001). Stochastic resource-constrained project scheduling.
  27. (2001). The minimum shift design problem and its relation to the minimum edge-cost °ow problem.
  28. (1989). The order-theoretic approach to scheduling: the deterministic case. In
  29. (1989). The order-theoretic approach to scheduling: the stochastic case.
  30. (1972). The transitive reduction of a directed graph.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.