Critical path analysis and resource constrained project scheduling — Theory and practice
✍ Scribed by R.J. Willis
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 883 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A new heuristic method is presented for the resolution of multiresource constrained conflicts in project scheduling. In attempting to find a minimal makespan solution, the algorithm employs a simple procedure to generate a feasible solution with no backtracking. A postanalysis phase then applies a h
A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource inf