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
✦ LIBER ✦
Resource-constrained project scheduling: Notation, classification, models, and methods
✍ Scribed by Peter Brucker; Andreas Drexl; Rolf Möhring; Klaus Neumann; Erwin Pesch
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 376 KB
- Volume
- 112
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A new heuristic solution method in resou
✍
Colin E. Bell; Jaemin Han
📂
Article
📅
1991
🏛
John Wiley and Sons
🌐
English
⚖ 979 KB
A competitive genetic algorithm for reso
✍
Sönke Hartmann
📂
Article
📅
1998
🏛
John Wiley and Sons
🌐
English
⚖ 100 KB
👁 2 views
Critical path analysis and resource cons
✍
R.J. Willis
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 883 KB
Resource-constrained construction projec
✍
Shu-Shun Liu; Chang-Jung Wang
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 487 KB
Project compression: A method for speedi
✍
Chuk Yau; Eric Ritchie
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 808 KB
A branch and bound algorithm for the res
✍
Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 257 KB
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