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

A constraint programming approach for the resource-constrained project scheduling problem

โœ Scribed by Olivier Liess; Philippe Michelon

Publisher
Springer US
Year
2007
Tongue
English
Weight
553 KB
Volume
157
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A genetic algorithm for multi-mode resou
A genetic algorithm for multi-mode resource constrained project scheduling problem
โœ Masao Mori; Ching Chih Tseng ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 540 KB

This article considers a general class of nonpreemptive multi-mode resource-constrained project scheduling problems in which activity durations depend on committed renewable resources (multi-mode time resource tradeoff). We propose a genetic algorithm for these problems and compare it with a stochas

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ 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