๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem

โœ Scribed by Robert Klein; Armin Scholl

Publisher
Springer
Year
2000
Tongue
English
Weight
292 KB
Volume
52
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Local search techniques for the generali
Local search techniques for the generalized resource constrained project scheduling problem
โœ Scott E. Sampson; Elliott N. Weiss ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 665 KB

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

The multiple resource constrained projec
The multiple resource constrained project scheduling problem: A breadth-first approach
โœ Terence Nazareth; Sanjay Verma; Subir Bhattacharya; Amitava Bagchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

We describe a simple breadth-ยฎrst tree search scheme for minimizing the makespan of a project consisting of a partially ordered network of activities under multiple resource constraints. The method compares quite favourably with existing techniques that employ depth-ยฎrst or best-ยฎrst search; in part