## Abstract The applicability of critical path scheduling is limited by the inability of the algorithm to cope with conflicting resource demands. This paper is an assessment of the effectiveness of many of the heuristic extensions to the critical path method which resolve the conflicts that develop
β¦ LIBER β¦
Alternative resources in project scheduling
β Scribed by R.K-Y. Li; R.J. Willis
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 493 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Alternate methods of project scheduling
β
James H. Patterson
π
Article
π
1973
π
John Wiley and Sons
π
English
β 986 KB
An iterative scheduling technique for re
β
K.Y. Li; R.J. Willis
π
Article
π
1992
π
Elsevier Science
π
English
β 614 KB
Batch scheduling in process industries:
β
Christoph Schwindt; Norbert Trautmann
π
Article
π
2000
π
Springer
π
German
β 413 KB
Heuristics for scheduling resource-const
β
Ji Zhan
π
Article
π
1994
π
Elsevier Science
π
English
β 1015 KB
Tight LP bounds for resource constrained
β
Philippe Baptiste; Sophie Demassey
π
Article
π
2004
π
Springer
π
German
β 128 KB
A new heuristic solution method in resou
β
Colin E. Bell; Jaemin Han
π
Article
π
1991
π
John Wiley and Sons
π
English
β 979 KB
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